Solving a class of semidefinite programs via nonlinear programming

Mathematical Programming, Series B

Volumn 93, Issue 1, 2002, Pages 97-122

  Burer, Samuel ^a   Monteiro, Renato D C ^b   Zhang, Yin ^c  

^a UNIVERSITY OF IOWA   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c Rice University   (United States)

Author keywords

First order methods; Interior point methods; Log barrier algorithms; Nonlinear programming; Semidefinite program; Semidefinite relaxation; Transformation

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRADIENT METHODS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING;

FIRST-ORDER METHODS; INTERIOR-POINT METHODS; LOG-BARRIER ALGORITHMS; SEMIDEFINITE PROGRAM; SEMIDEFINITE RELAXATION;

NONLINEAR PROGRAMMING;

EID: 0346448948     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100279     Document Type: Article

References (20)

1. Benson, S., Ye, Y., Zhang, X. (2000): Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM Journal on Optimization 10, 443-461
2. Burer, S., Monteiro, R.D.C. (2001): A projected gradient algorithm for solving the MAXCUT SDP relaxation. Optimization Methods and Software 15, 175-200
3. Burer, S., Monteiro, R.D.C., Zhang, Y. (2001): A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Manuscript. June, 2001. Submitted to Mathematical Programming Series B
4. Burer, S., Monteiro, R.D.C., Zhang, Y.: Interior-point algorithms for semidefinite programming based on a nonlinear formulation. To appear in Computational Optimization and Applications
5. Delorme, C., Poljak, S. (1993): Laplacian eigenvalues and the maximum cut problem. Mathematical Programming 62, 557-574
6. Fujisawa, K., Kojima, M., Nakata, K. (1997): Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Mathematical Programming 79, 235-253
7. Goemans, M.X., Williamson, D.P. (1995): Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM 42, 1115-1145
8. Golub, G.H., Van Loan, C.E. (1989): Matrix Computations: Second Edition. The Johns Hopkins University Press, Baltimore, MD 21211
9. Helmberg, C., Rendl, F. (2000): A spectral bundle method for semidefinite programming. SIAM Journal on Optimization 10, 673-696
10. Homer, S., Peinado, M. (1995): Design and performance of parallel and distributed approximation algorithms for maxcut. Manuscript, Dept. of Computer Science and Center for Computational Science, Boston University, 111 Cummington Street, Boston, MA, 02215, USA
11. Laurent, M., Poljak, S., Rendl, F. (1997): Connections between semidefinite relaxations of the max-cut and stable set problems. Mathematical Programming 77, 225-246
12. Lovász, L. (1979): On the Shannon Capacity of a graph. IEEE Transactions of Information Theory IT-25(1), 1-7
13. Lovász, L., Schrijver, A. (1991): Cones of matrices and set functions, and 0-1 optimization. SIAM Journal on Optimization 1, 166-190
14. Monteiro, R.D.C., Pang, J.S. (1998): On two interior-point mappings for nonlinear semidefinite complementarity problems. Mathematics of Operations Research 23, 39-60
15. Nesterov, Y. (1998): Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software 9, 141-160
16. Poljak, S., Rendl, F. (1995): Nonpolyhendral relaxations of graph-bisection problems. SIAM Journal on Optimization 5, 467-487
17. Poljak, S., Rendl, F., Wolkowicz, H. (1995): A recipe for semidefinite relaxation for 0-1 quadratic programming. Journal of Global Optimization 7, 51-73
18. Poljak, S., Tuza, Z. (1995): Maximum cuts and largest bipartite subgraphs. Combinatorial Optimization. Cook, W., Lovász, L., Seymour, P., eds., DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 20, American Mathematical Society
19. Shor, N.Z. (1987): Quadratic optimization problems. Soviet Journal of Computer and Systems Science 25, 1-11.
20. Originally published in Tekhnicheskaya Kibemetika No. 1, 1987, 128-139