Solving semidefinite-quadratic-linear programs using SDPT3

Mathematical Programming, Series B

Volumn 95, Issue 2, 2003, Pages 189-217

  Tutuncu R H ^a   Toh, K C ^b   Todd, M J ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; CONSTRAINT THEORY; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

LINEAR OPTIMIZATION; SEMIDEFINITE, QUADRATIC, AND LINEAR CONE CONSTRAINTS (SQLP);

LINEAR PROGRAMMING;

EID: 3142743708     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0347-5     Document Type: Article

References (31)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. F. Alizadeh, J.-P.A. Haeberly, and M.L. Overton, Primal-dual interior-point methods for semidefinite programming: convergence results, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
3. F. Alizadeh, J.-P.A. Haeberly, M.V. Nayakkankuppam, M.L. Overton, and S. Schmieta, SDPPACK user's guide, Technical Report, Computer Science Department, NYU, New York, June 1997.
4. B. Horchers, SDPLIB 1.2, a library of semidefinite programming test problems, Optim. Methods Softw., 11 & 12 (1999), pp. 683-690. Available at http://www.nmt.edu/~borchers/sdplib.html.
5. B. Borchers, CSDP, a C library for semidefinite programming, Optim. Methods Softw., 11 & 12 (1999), pp. 613-623. Available at http://www.nmt.edu/~borchers/csdp.html.
6. K. Fujisawa, M. Kojima, and K. Nakata, Exploiting sparsity in primal-dual interior-point method for semidefinite programming. Math. Program., 79 (1997), pp. 235-253.
7. K. Fujisawa, M. Kojima, and K. Nakata, SDPA (semidefinite programming algorithm) - user's manual, Research Report, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo. Available via anonymous ftp at ftp.is.titech.ac.jp inpub/OpRes/software/SDPA.
8. D. Goldfarb, and K. Scheinberg, A product-form Cholesky factorization implementation of an interiorpoint method for second order cone programming, preprint.
9. G.H. Golub, and C.F. Van Loan, Matrix Computations, 2nd ed., (Johns Hopkins University Press, Baltimore, MD, 1989)
10. C. Helmberg, F. Rendl, R. Vanderbei and H. Wolkowicz, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
11. N.J. Higham, Accuracy and Stability of Numerical Algorithms, (SIAM, Philadelphia, 1996)
12. M. Kojima, S. Shindoh, and S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
13. The MathWorks, Inc., Using MATLAB, (The MathWorks, Inc., Natick, MA, 1997)
14. S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
15. H.D. Mittelmann, An independent benchmarking of SDP and SOCP solvers, Math. Program., this issue.
16. R.D.C.Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
17. Yu. Nesterov and M. J. Todd, Self-scaled barriers and interior-point methods in convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
18. E.G. Ng and B.W. Peyton, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput., 14 (1993), pp. 1034-1056.
19. G. Pataki and S. Schmieta, The DIMACS library of mixed semidefinite-quadratic-linear programs. Available at http://dimacs.rutgers.edu/ Challenges/Seventh/Ins tances.
20. F. A. Potra and R. Sheng, On homogeneous interior-point algorithms for semidefinite programming, Optim. Methods Softw. 9 (1998), pp. 161-184.
21. J.F. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones, Optim. Methods Softw., 11 & 12 (1999), pp. 625-653.
22. M.J. Todd, K.C. Toh, R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optim., 8 (1998), pp. 769-796.
23. K. C. Toh, Some new search directions for primal-dual interior point methods in semidefinite programming, SIAM J. Optim., 11 (2000), pp. 223-242.
24. K.C. Toh, A note on the calculation of step-lengths in interior-point methods for semidefinite programming, Comput. Optim. Appl., 21 (2002), pp. 301-310.
25. K.C. Toh, M.J. Todd, R.H. Tütüncü, SDPT3 - a Matlab software package for semidefinite programming, Optim. Methods Softw., 11 & 12 (1999), pp. 545-581.
26. T. Tsuchiya, A polynomial primal-dual path-following algorithm for second-order cone programming, Technical Report, The Institute of Statistical Mathematics, Minato-Ku, Tokyo, October 1997.
27. T. Tsuchiya, A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, Optim. Methods Softw., 11 & 12 (1999), pp. 141-182.
28. R.H. Tütüncü, K.C. Toh, M.J. Todd, SDPT3 - a Matlab software package for semidefinite-quadraticlinear programming, version 3.0. Available at http://www.math.nus. edu.sg/~mattohkc/.
29. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
30. L. Vandenberghe and S. Boyd, User's guide to SP: software for semidefinite programming, Information Systems Laboratory, Stanford University, November 1994. Available via anonymous ftp at isl. stanford, edu in pub/boyd/semidef_prog. Beta version.
31. Y. Zhang, Solving large-scale linear programs by interior-point methods under the MATLAB environment, Optim. Methods Softw., 10 (1998), pp. 1-31.