Abstract.
This work reports the results of evaluating all computer codes submitted to the Seventh DIMACS Implementation Challenge on Semidefinite and Related Optimization Problems. The codes were run on a standard platform and on all the benchmark problems provided by the organizers of the challenge. A total of ten codes were tested on fifty problems in twelve categories. For each code the most important information is summarized. Together with the tabulated and commented benchmarking results this provides an overview of the state of the art in this field.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 27, 2001 / Accepted: April 5, 2002 Published online: October 9, 2002
Key Words. semidefinite programming – second order cone programming – optimization software – performance evaluation
This work is supported in part by grant NSF-CISE-9981984
Rights and permissions
About this article
Cite this article
Mittelmann, H. An independent benchmarking of SDP and SOCP solvers. Math. Program., Ser. B 95, 407–430 (2003). https://doi.org/10.1007/s10107-002-0355-5
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0355-5