A Linear Programming Approach to Semidefinite Programming Problems

A semidefinite programming problem can be regarded as a convex nonsmooth optimization problem, so it can be represented as a semi-infinite linear programming problem. Thus, in principle, it can be solved using a cutting plane approach; we describe such a method. The cutting plane method uses an interior point algorithm to solve the linear programming relaxations approximately, because this resulted in the generation of better constraints than a simplex cutting plane method. Further, the bundle method of Helmberg and Rendl can be used to generate a set of linear constraints. Typically, these alone are not sufficient to give a good linear programming relaxation. Nonetheless, if they are used in conjunction with some families of problem specific constraints, tight LP relaxations can be obtained. Solving SDP via LP 2

[1]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[2]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[5]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[6]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[7]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[8]  Michael J. Todd,et al.  Solving combinatorial optimization problems using Karmarkar's algorithm , 1992, Math. Program..

[9]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[10]  Kenneth O. Kortanek,et al.  Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..

[11]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[12]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..

[13]  Alexander Shapiro,et al.  On Eigenvalue Optimization , 1995, SIAM J. Optim..

[14]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[15]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[16]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[17]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[18]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[19]  Brian Borchers,et al.  SDPLIB 1.1, A Library of Semidefinite Programming Test Problems , 1998 .

[20]  Jon M. Kleinberg,et al.  The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover , 1998, SIAM J. Discret. Math..

[21]  Gábor Pataki,et al.  On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues , 1998, Math. Oper. Res..

[22]  Renato D. C. Monteiro,et al.  Solving Semidefinite Programs via Nonlinear Programming, Part II: Interior Point Methods for a Subclass of SDPs , 1999 .

[23]  Stefan Schmieta,et al.  The DIMACS library of semidefinite-quadratic-linear programs , 1999 .

[24]  Yinyu Ye,et al.  Approximating quadratic programming with bound and quadratic constraints , 1999, Math. Program..

[25]  C. Helmberg.  Semidefinite Programming for Combinatorial Optimization , 2000 .

[26]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[27]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[28]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[29]  François Oustry,et al.  A second-order bundle method to minimize the maximum eigenvalue function , 2000, Math. Program..

[30]  Vanderbei Robert,et al.  On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems , 2000 .

[31]  Christoph Helmberg,et al.  Bundle Methods to Minimize the Maximum Eigenvalue Function , 2000 .

[32]  C. Helmberg.  SBmethod - A C++ Implementation of the Spectral Bundle Method: Manual to Version 1.1 , 2000 .

[33]  Y. Ye,et al.  Approximating Maximum Stable Set and Minimum Graph Coloring Problems with the Positive Semidefinite Relaxation , 2001 .

[34]  Yinyu Ye,et al.  A .699-Approximation Algorithm for Max-Bisection , 1999 .

[35]  Yin Zhang,et al.  Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs , 2002, SIAM J. Optim..

[36]  Christoph Helmberg,et al.  A spectral bundle method with bounds , 2002, Math. Program..

[37]  Yin Zhang,et al.  Maximum stable set formulations and heuristics based on continuous optimization , 2002, Math. Program..

[38]  Renato D. C. Monteiro,et al.  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..

[39]  Franz Rendl,et al.  Computational Experience with Stable Set Relaxations , 2002, SIAM J. Optim..

[40]  Marco A. López,et al.  Semi-infinite programming , 2007, Eur. J. Oper. Res..