SDPT3 - a MATLAB software package for semidefinite programming, version 1.3

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 545-581

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Cornell University   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING;

SEMIDEFINITE PROGRAMMING (SDP); SOFTWARE PACKAGE MATLAB;

COMPUTER SOFTWARE;

EID: 0033295027     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805762     Document Type: Article

References (26)

1. Aasen, J. O. (1971). On the reduction of a symmetric matrix to tridiagonal form, BIT 11, 233-242.
2. Alizadeh, F. (1995). Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optimization, 5, 13-51.
3. Alizadeh, R, Haeberly, J. -P. A. and Overton, M. L. (1998). Primal-dual interior-point methods for semidefinite programming: convergence results, stability and numerical results, SIAM J. Optimization, 8, 746-768.
4. Alizadeh, R, Haeberly, J. -P. A., Nayakkankuppam, M. V., Overton, M. L. and Schmieta, S. SDPPACK user's guide, Technical Report, Computer Science Department, NYU, New York, June 1997.
5. Borchers, B. SDPLIB, A Library of Semidefinite Programming Test Problems, available from http://www.nmt.edu/borchers/sdplib.html.
6. Brixius, N., Potra, F. A. and Sheng, R. (1996). Solving semidefinite programming in Mathematica, Reports on Computational Mathematics, No 97/1996, Department of Mathematics, University of Iowa, October. Available at http://www.cs.uiowa.edu/brixius/sdp.html.
7. Brixius, N., Potra, F. A. and Sheng, R. (1998). SDPHA: A Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, available from http://www.cs.uiowa.edu/brizius/SDPHA/, May.
8. Fujisawa, K., Kojima, M. and Nakata, K. (1997). Exploiting sparsity in primal-dual interior-point method for semidefinite programming, Mathematical Programming, 79, 235-253.
9. Fujisawa, K., Kojima, M. and Nakata, K. 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 in pub/OpRes/software/SDPA.
10. Helmberg, C., Rendl, F., Vanderbei R. and Wolkowicz, H. (1996). An interior-point method for semidefinite programming, SIAM Journal on Optimization, 6, 342-361.
11. de Klerk, E., Roos, C. and Terlaky, T. (1997). Infeasible start, semidefinite programming algoritluns via self-dual embeddings, Report 97-10, TWI, Delft University of Technology, April.
12. Kojima, M., Shindoh, S. and Hara, S. (1997). Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM J. Optimization, 7, 86-125.
13. Luo, Z. -Q., Sturm, J. F. and Zhang, S. (1996). Duality and self-duality for conic convex programming, Technical Report 9620/A, Tinbergen Institute, Erasmus University, Rotterdam.
14. The Math Works, Inc., Using MATLAB, The Math Works, Inc., Natick, MA, 1997.
15. Mehrotra, S. (1992). On the implementation of a primal-dual interior point method, SIAM J. Optimization, 2, 575-601.
16. Monteiro, R. D. C. (1997). Primal-Dual Path-Following Algorithms for Semidefinite Programming, SIAM J. Optimization, 7, 663-678.
17. Potra, F. A. and Sheng, R. (1998). On homogeneous interior-point algorithms for semidefinite programming, Optimization Methods and Software 9, 161-184.
18. Saad, Y. Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston.
19. Sturm, J. F. (1998). SeDuMi 1.00: Self-dual-minimization. Matlab 5 toolbox for optimization over symmetric cones, Communications Research Laboratory, McMaster University, Hamilton, Canada, April.
20. Todd, M. J., Toh, K. C. and Tütüncü, R. H. (1998). On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optimization, 8, 769-796.
21. Toh, K. C. (1998). Search directions for primal-dual interior point methods in semidefinite programming, Technical Report No. 722, Department of Mathematics, National University of Singapore, Singapore, July, 1997. Revised in March.
22. Toh, K. C. and Trefethen, L. N. The Chebyshev polynomials of a matrix, to appear in SIAM J. Matrix Analysis and Applications.
23. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming, SIAM Review, 38, 49-95.
24. Vandenberghe, L. and Boyd, S. (1994). 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.
25. Xu, X., Hung, P. -F. and Ye, Y. (1996). A simplified homogeneous and self-dual linear programming algorithm and its implementation, Annals of Operations Research, 62, 151-171.
26. Ye, Y., Todd, M. J. and Mizuno, S. (1994). An O(√nL)-iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research, 19, 53-67.