Tütüncü, R. H.; Toh, K. C.; Todd, M. J. Solving semidefinite-quadratic-linear programs using SDPT3. (English) Zbl 1030.90082 Math. Program. 95, No. 2 (B), 189-217 (2003). Summary: 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. Cited in 1 ReviewCited in 271 Documents MSC: 90C22 Semidefinite programming 90C20 Quadratic programming 90C05 Linear programming Software:sdpt3r; SeDuMi; SDPLIB; Matlab; SDPT3 PDFBibTeX XMLCite \textit{R. H. Tütüncü} et al., Math. Program. 95, No. 2 (B), 189--217 (2003; Zbl 1030.90082) Full Text: DOI