A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs

Abstract. The authors of this paper recently introduced a transformation [4] that converts a class of semidefinite programs (SDPs) into nonlinear optimization problems free of matrix-valued constraints and variables. This transformation enables the application of nonlinear optimization techniques to the solution of certain SDPs that are too large for conventional interior-point methods to handle efficiently. Based on the transformation, we proposed a globally convergent, first-order (i.e., gradient-based) log-barrier algorithm for solving a class of linear SDPs. In this paper, we discuss an efficient implementation of the proposed algorithm and report computational results on semidefinite relaxations of three types of combinatorial optimization problems. Our results demonstrate that the proposed algorithm is indeed capable of solving large-scale SDPs and is particularly effective for problems with a large number of constraints.

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

[2]  Yin Zhang,et al.  Digital Object Identifier (DOI) 10.1007/s101070100279 , 2000 .

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

[4]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[5]  Hans D. Mittelmann,et al.  An independent benchmarking of SDP and SOCP solvers , 2003, Math. Program..

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

[7]  David P. Williamson,et al.  Improved approximation algorithms for MAX SAT , 2000, SODA '00.

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

[9]  Jorge Nocedal,et al.  Representations of quasi-Newton matrices and their use in limited memory methods , 1994, Math. Program..

[10]  A. Eisenblätter.  Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds , 2001 .

[11]  Yin Zhang,et al.  Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation , 2002, Comput. Optim. Appl..

[12]  Masakazu Kojima,et al.  Exploiting sparsity in primal-dual interior-point methods for semidefinite programming , 1997, Math. Program..

[13]  R. C. Monteiro,et al.  Interior-Point Algorithms for Semidefinite Programming Based on A Nonlinear Programming Formulation , 1999 .

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

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

[16]  Martin Grötschel,et al.  Frequency planning and ramifications of coloring , 2002, Discuss. Math. Graph Theory.

[17]  R. Monteiro,et al.  A projected gradient algorithm for solving the maxcut SDP relaxation , 2001 .

[18]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[19]  R. Monteiro,et al.  Solving SemideÞnite Programs via Nonlinear Programming Part I: Transformations and Derivatives É , 1999 .

[20]  Franz Rendl,et al.  Connections between semidefinite relaxations of the max-cut and stable set problems , 1997, Math. Program..

[21]  Marcus Peinado,et al.  Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut , 1997, J. Parallel Distributed Comput..

[22]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.