Computational enhancements in low-rank semidefinite programming

Optimization Methods and Software

Volumn 21, Issue 3, 2006, Pages 493-512

  Burer, Samuel ^a   Choi, Changhui ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Low rank matrices; Non linear programming; Numerical experiments; Semidefinite programming; Vector programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING;

DYNAMIC RANK REDUCTION; SEMIDEFINITE PROGRAMMING ALGORITHM; TRUNCATED NEWTON VARIANT;

ALGORITHMS;

EID: 30944459068     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500286582     Document Type: Article

References (41)

1. Borchers, B., 1999, CSDP, a C library for semidefinite programming. Optimization Methods and Software, 11(1), 613-623.
2. Benson, S., Ye, Y. and Zhang, X., 2000, Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM Journal on Optimization, 10, 443-461.
3. Kočvara, M. and Stingl, M., 2003, Pennon: a code for convex nonlinear and semidefinite programming. Optimization Methods and Software, 18(3), 317-333.
4. Sturm, J.F., 1999, Using SeDuMi 1.02, aMATLAB toolbox for optimization over symmetric cones. Optimization Methods Software, 11/12(1-4), 625-653 (Interior point methods).
5. Yamashita, M., Fujisawa, K., and Kojima, M., 2003, Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0). Optimization Methods and Software, 18(4), 491-505. The Second Japanese-Sino Optimization Meeting, Part II (Kyoto, 2002).
6. Tütüncü R.H., Toh, K.C. and Todd, M.J., 2001, SDPT3: a Matlab software package for semidefinite-quadratic-linear programming, version 3.0. Available online at: http://www.math.nus.edu.sg/mattohkc/sdpt3.html.
7. Lin, C.-J. and Saigal, R., 1997, On solving large scale semidefinite programming problems: a case study of quadratic assigment problem. Technical Report, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2177.
8. Nakata, K., Fujisawa, K. and Kojima, M., 1998, Using the conjugate gradient method in interior-points for semidefinite programs. Proceedings of the Institute of Statistical Mathematics, 46, 297-316 (in Japanese).
9. Choi, C. and Ye, Y., 2000, Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. Manuscript, Department of Management Sciences, University of Iowa, Iowa City, IA 52242, USA.
10. Toh, K. and Kojima, M., 2002, Solving some large scale semidefinite programs via the conjugate residual method. SIAM Journal on Optimization, 12, 669-691.
11. Toh, K.C. 2004, Solving large scale semidefinite programs via an iterative solver on the agumented systems. SIAM Journal on Optimization, 14, 670-698.
12. Burer, S., 2003, Semidefinite programming in the space of partial positive semidefinite matrices. SIAM Journal on Optimization, 14(1), 139-172.
13. Kočvara, M. and Stingl, M., 2005, On the solution of large-scale sdp problems by the modified barrier method using iterative solvers. Research report 304, Institute of Applied Mathematics, University of Erlangen.
14. Burer, S. and Monteiro, R., 2003, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming (Series B), 95, 329-357.
15. Burer, S. and Monteiro, R., 2005, Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103(3), 427-444.
16. Burer, S., Monteiro, R. and Zhang, Y., 2002, Solving a class of semidefinite programs via nonlinear programming. Mathematical Programming, 93, 97-122.
17. Burer, S., Monteiro, R. and Zhang, Y., 2003, A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Mathematical Programming (Series B), 95, 359-379
18. Fukuda, M. and Kojima, M., 2000, Interior-point methods for lagrangian duals of semidefinite programs. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguru-ku, Tokyo 152, Japan.
19. Helmberg, C. and Kiwiel, K., 1994, A spectral bundle method with bounds. Mathematical Programming, 93(2), 173-194.
20. Helmberg, C. and Rendl, E., 2000, A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673-696.
21. Pataki, G., 1998, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Mathematics of Operations Research, 23, 339-358.
22. Barvinok, A., 1995, Problems of distance geometry and convex properties of quadratic maps. Discrete Computational Geometry, 13, 189-202.
23. Nocedal, J. and Wright, S., 1999, Numerical Optimization, (New York: Springer-Verlag).
24. Dembo, R.S., Eisenstat, S.C. and Steihaug, T., 1982, Inexact Newton methods. SIAM Journal of Numerical Analysis, 19(2), 400-408.
25. Galassi, M., Davies, J., Theiler, J., Gough, B., Jungman, G., Booth, M. and Rossi, F. GNU Scientific Library Reference Manual, (2nd edn) Available online at: http://www.gnu.org/software/gsl/.
26. Businger, P. and Golub, G.H., 1965, Handbook series linear algebra. Linear least squares solutions by householder transformations. Numerische Mathematik, 7, 269-276.
27. Quintana-Orti, G., Sun, X. and Bischof, C.H., 1998, A BLAS-3 version of the QR factorization with column pivoting. SIAM Journal of Scientific Computing, 1998(5), 1486-1494 (electronic).
28. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A. and Sorensen, D., 1999, LAPACK Users' Guide (3rd edn) (Philadelphia, PA: Society for Industrial and Applied Mathematics).
29. Lehoucq, R.B., Sorensen, D.C. and Yang, C., 1998, ARPACK Users' Guide: Solution, of Large-Scale Eigen-value Problems with Implicitly Restarted Arnoldi Methods (Philadelphia: Society for Industrial and Applied Mathematics).
30. Mittelmann, H.D. Available online at: http://plato.la.asu.edu/topics/testcases.html.
31. Dolan, E.D. and Moré, J.J., 2002, Benchmarking optimization software with performance profiles. Mathematical Programming Series A, 91(2), 201-213.
32. Morales, J.L. and Nocedal, J., 2000, Automatic preconditioning by limited memory quasi-Newton updating. SIAM Journal of Optimization, 10(4), 1079-1096 (electronic).
33. Mirsky, L., 1960, Symmetric gauge functions and unitarily invariant norms. The Quarterly Journal of Mathematics, Oxford Series 2, 11, 50-59.
34. Schmidt, E., 1907, Mathematische Annalen, 63, 433-476. Zur Theorie der linearen und nichtlinearen Integralgleichungen. I Tiel. Entwicklung willkürlichen Funktionen nach System vorgeschriebener.
35. Mittelmann, H.D., 2003, An independent benchmarking of SDP and SOCP solvers. Mathematical Programming Series B, 95(2), 407-430 (Computational semidefinite and second order cone programming: the state of the art).
36. Pataki, G. and Schmieta, S., 1999, The DIMACS library of semidefinite-quadratic-linear programs. Technical report. Available online at: http://dimacs.rutgers.edu/Challenges/Seventh/Instances/.
37. Borchers, B., 1999, SDPLIB 1.2, a library of semidefinite programming test problems. Optimization Methods and Software, 11(1), 683-690.
38. Keuchel, J., Schnörr, C. Schellewald, C. and Cremers, D., 2003, Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(11), 1364-1379.
39. M. Anjos, Kennings, A. and Vannelli, A., 2004, A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optimization, 2(2), 113-122.
40. Zhao, Z., Braams, B.J., Fukuda, M., Overton, M.L. and Percus, J.K., 2004, The reduced density matrix method for electronic structure calculations and the role of three-index representability conditions. The Journal of Chemical Physics, 120(5), 2095-2104.
41. Zowe, J., Kočvara and Bendsøe, M.P., 1997, Free material optimization via mathematical programming. Mathematical Programming, Series B, 79(1-3), 445-466.