Local minima and convergence in low-rank semidefinite programming

Mathematical Programming

Volumn 103, Issue 3, 2005, Pages 427-444

  Burer, Samuel ^a   Monteiro, Renato D C ^b  

^a UNIVERSITY OF IOWA   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Augmented Lagrangian; Combinatorial optimization; Low rank matrices; Nonlinear programming; Numerical experiments; Semidefinite programming; Vector programming

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; OPTIMIZATION; VECTORS;

AUGMENTED LAGRANGIAN; COMBINATORIAL OPTIMIZATION; LOW-RANK MATRICES; NUMERICAL EXPERIMENTS; SEMIDEFINITE PROGRAMMING; VECTOR PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 21644465788     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0564-1     Document Type: Article

References (27)

1. Alizadeh, F., Haeherly, J.-P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization, 8, 746-768 (1998)
2. K.M. Anstreicher, Recent advances in the solution of quadratic assignment problems. Mathematical Programming (Series B), 97 (1-2), 27-42 (2003)
3. Barker, G.P., Carlson, D.: Cones of diagonally dominant matrices. Pacific Journal of Mathematics, 57 (1), 15-32 (1975)
4. Burer, S.: Semidefinite programming in the space of partial positive semidefinite matrices. SIAM Journal on Optimization, 14 (1), 139-172 (2003)
5. Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming (Series B), 95, 329-357 (2003)
6. Burer, S., Monteiro, R.D.C., Zhang, Y.: Solving a class of semidefinite programs via nonlinear programming. Mathematical Programming, 93, 97-122 (2002)
7. Burkard, R.E.;., Karisch, S., Rendl, E.: QAPLIB - a quadratic assignment problem library. European Journal of Operational Research, 55, 15-119 (1991)
8. Helmberg, C.: Semidefinite programming for combinatorial optimization. ZID-Report 00-34, Konrad-Zuse-Zentrum für Informationstechnik Berlin, October 2000.
9. Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673-696 (2000)
10. Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz., H.: An interior-point method for semidefinite programming. SIAM Journal on Optimization, 6, 342-361 (1996)
11. Hiriart-Urruty, J.-B., Lemaréchal, C., Convex analysis and minimization algorithms. I, volume 305 of Grundlehren der Mathematischen Wissenschaften (Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 1993.
12. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York, 1985.
13. Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization, 7, 86-125 (1997)
14. Lin, C-J., Saigal, R.: On solving large scale semidefinite programming problems: a case study of quadratic assigment problem. Technical Report, IX-pt. of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2177, 1997.
15. Monteiro, R.D.C.: First- and second-order methods for semidefinite programming. Mathematical Programming, 97, 209-244 (2003)
16. Monteiro, R.D.C.: Primal-dual path following algorithms for semidefinite programming. SIAM Journal on Optimization, 7, 663-678 (1997)
17. Monteiro, R.D.C., Zhang, Y.: A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Mathematical Programming, 81, 281-299 (1998)
18. Nakata, K., Fujisawa, K., Kojima, M.: Using the conjugate gradient method in interior-points for semidefinite programs. Proceedings of the Institute of Statistical Mathematics, 46, 297-316 (1998) In Japanese.
19. Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Mathematics of Operations Research, 23, 339-358 (1998)
20. Pataki, G.: The geometry of semidefinite programming. In II. Wolkowicz., R. Saigal, L. Vandenberghe, (eds.), Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Kluwer Academic Publishers, 2000.
21. Rendl, F., Sotirov, R.: Bounds for the quadratic assignment problem using the bundle method. Manuscript, University of Klagenfurt, August 2003.
22. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
23. De Simone, C.: The cut polytope and the boolean quadric polytope. Discrete Mathematics, 79, 71-75 (1989)
24. Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the agumented systems. SIAM Journal on Optimization, 14, 670-698 (2004)
25. Toh, K.C., Kojima, M.: Solving some large scale semidefinite programs via the conjugate residual method. SIAM Journal on Optimization, 12, 669-691 (2002)
26. Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM Journal on Optimization, 8, 365-386 (1998)
27. Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. Journal of Combinatorial Optimization, 2, 71-109 (1998)