Abstract
We investigate the augmented Lagrangian penalty function approach to solve semidefinite programs. It turns out that this method generates iterates which lie on the boundary of the cone of semidefinite matrices which are driven to the affine subspace described by the linear equations defining the semidefinite program. We provide some computational experience with this method and show in particular, that it allows to compute the theta number of a graph to reasonably high accuracy for instances which are beyond reach by other methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bertsekas, D.: Constrained optimization and Lagrange multiplier methods. Academic Press 1982.
S. Burer R. D. C. Monteiro (2003) ArticleTitleA nonlinear programming algorithm for solving semidefinite programs via low-rank factorization Math. Progr. (B) 95 329–357 Occurrence Handle1030.90077 Occurrence Handle1976484 Occurrence Handle10.1007/s10107-002-0352-8
S. Burer D. Vandenbussche (2006) ArticleTitleSolving lift-and-project relaxations of binary integer programs SIAM J. Optim. 16 726–750 Occurrence Handle05028994 Occurrence Handle2197554 Occurrence Handle10.1137/040609574
Dukanovic, I., Rendl, F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Progr. (forthcoming).
N. J. Higham (1988) ArticleTitleComputing a nearest symmetric positive semidefinite matrix Linear Algebra Appl. 103 103–118 Occurrence Handle0649.65026 Occurrence Handle943997 Occurrence Handle10.1016/0024-3795(88)90223-6
Kocvara, M., Stingl, M.: On the solution of large-scale sdp problems by the modified barrier method using iterative solvers. Technical report 2005.
L. Lovász (1979) ArticleTitleOn the shannon capacity of a graph IEEE Trans. Inform. Theory 25 1–7 Occurrence Handle0395.94021 Occurrence Handle514926 Occurrence Handle10.1109/TIT.1979.1055985
J. Malick (2004) ArticleTitleA dual approach to semidefinite least-squares problems SIAM J. Matrix Anal. Appl. 26 272–284 Occurrence Handle1080.65027 Occurrence Handle2112861 Occurrence Handle10.1137/S0895479802413856
Malick, J., Povh, J., Rendl, F., Wiegele, A.: Proximal methods for semidefinite programming. Technical report 2006.
H. D. Mittelmann (2003) ArticleTitleAn independent benchmarking of SDP and SOCP solvers Math. Progr. (B) 95 407–430 Occurrence Handle1030.90080 Occurrence Handle1976487 Occurrence Handle10.1007/s10107-002-0355-5
Povh, J.: Applications of semidefinite and copositive programming in combinatorial optimization. PhD thesis, Universtity of Ljubljana, Slovenia, 2006.
A. Schrijver (2003) Combinatorial optimization. Polyhedra and efficiency, vol. B. Algorithms and Combinatorics, vol. 24 Springer Berlin
M. J. Todd (1999) ArticleTitleA study of search directions in primal-dual interior-point methods for semidefinite programming Optim. Meth. Software 11 1–46 Occurrence Handle0997.90060 Occurrence Handle1777451
K.-C. Toh (2003) ArticleTitleSolving large scale semidefinite programs via an iterative solver on the augmented systems SIAM J. Optim. 14 670–698 Occurrence Handle1071.90026 Occurrence Handle2085936 Occurrence Handle10.1137/S1052623402419819
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by EU project Algorithmic Discrete Optimization (ADONET), MRTN-CT-2003-504438.
Rights and permissions
About this article
Cite this article
Povh, J., Rendl, F. & Wiegele, A. A Boundary Point Method to Solve Semidefinite Programs. Computing 78, 277–286 (2006). https://doi.org/10.1007/s00607-006-0182-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-006-0182-2