Year: 2019
Type: article
Abstract: In order to compare and benchmark the mathematical software, the performance profiles have been introduced [1]. However, it has been proved that the algorithm is not flawless. The main issue with the performance profile is that it may rank the solvers with respect to the best solver, by excluding the best one and running the algorithm on the remaining set of the solvers, the method may rank the solvers in a different way. We characterize such systems of problems-solvers and propose an efficient and reliable algorithm to overcome this negative side effect. The proposed method is unbiased in comparing the solvers and is successful in detecting the top ones.
Authors: Rasoul Hekmati, Hanieh Mirhajianmoghadam
Institution: University of Houston
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2889831366