A boundary point method to solve semidefinite programs

Computing (Vienna/New York)

Volumn 78, Issue 3, 2006, Pages 277-286

  Povh, J ^a,c   Rendl, F ^b,c   Wiegele, A ^b,c  

^a Higher Education Centre Novo Mesto School of Business and Management   (Slovenia)

^b UNIVERSITY OF KLAGENFURT   (Austria)

^c NONE

Author keywords

Augmented Lagrangian method; Semidefinite programming; Theta function

Indexed keywords

BOUNDARY POINT METHOD; LAGRANGIAN PENALTY FUNCTION; SEMIDEFINITE PROGRAMS;

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; FUNCTIONS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

BOUNDARY ELEMENT METHOD;

EID: 33751550994     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-006-0182-2     Document Type: Article

References (14)

1. Bertsekas, D.: Constrained optimization and Lagrange multiplier methods. Academic Press 1982.
2. Burer, S., Monteiro, R. D. C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Progr. (B) 95, 329-357 (2003).
3. Burer, S., Vandenbussche, D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16, 726-750 (2006).
4. Dukanovic, I., Rendl, F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Progr. (forthcoming).
5. Higham, N. J.: Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103, 103-118 (1988).
6. Kocvara, M., Stingl, M.: On the solution of large-scale sdp problems by the modified barrier method using iterative solvers. Technical report 2005.
7. Lovász, L.: On the shannon capacity of a graph. IEEE Trans. Inform. Theory 25, 1-7 (1979).
8. Malick, J.: A dual approach to semidefinite least-squares problems. SIAM J. Matrix Anal. Appl. 26, 272-284 (2004).
9. Malick, J., Povh, J., Rendl, F., Wiegele, A.: Proximal methods for semidefinite programming. Technical report 2006.
10. Mittelmann, H. D.: An independent benchmarking of SDP and SOCP solvers. Math. Progr. (B) 95, 407-430 (2003).
11. Povh, J.: Applications of semidefinite and copositive programming in combinatorial optimization. PhD thesis, Universtity of Ljubljana, Slovenia, 2006.
12. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency, vol. B. Algorithms and Combinatorics, vol. 24. Berlin: Springer 2003.
13. Todd, M. J.: A study of search directions in primal-dual interior-point methods for semidefinite programming. Optim. Meth. Software 11, 1-46 (1999).
14. Toh, K.-C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. SIAM J. Optim. 14, 670-698 (2003).