Abstract.
This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type are solved using a new release of SDPT3, a Matlab implementation of infeasible primal-dual path-following algorithms. The software developed by the authors uses Mehrotra-type predictor-corrector variants of interior-point methods and two types of search directions: the HKM and NT directions. A discussion of implementation details is provided and computational results on problems from the SDPLIB and DIMACS Challenge collections are reported.
This is a preview of subscription content, log in to check access.
Author information
Affiliations
Additional information
Received: March 19, 2001 / Accepted: January 18, 2002 Published online: October 9, 2002
Mathematics Subject Classification (2000): 90C05, 90C22
Rights and permissions
About this article
Cite this article
Tütüncü, R., Toh, K. & Todd, M. Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program., Ser. B 95, 189–217 (2003). https://doi.org/10.1007/s10107-002-0347-5
Issue Date:
Keywords
- Computational Result
- Test Problem
- Computational Experiment
- Search Direction
- Implementation Detail