Optimization Online


A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs

Christoph Buchheim(christoph.buchheim***at***tu-dortmund.de)
Maribel Montenegro(maribel.montenegro***at***mathematik.tu-dortmund.de)
Angelika Wiegele(angelika.wiegele***at***aau.at)

Abstract: We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are characterized by a small total number of active constraints and by low-rank constraint matrices. We exploit this special structure by solving the dual problem, using a barrier method in combination with a coordinate-wise exact line search. The main ingredient of our algorithm is the computationally cheap update at each iteration and an easy computation of the exact step size. Compared to interior point methods, our approach is much faster in obtaining strong dual bounds. Moreover, no explicit separation and reoptimization is necessary even if the set of primal constraints is large, since in our dual approach this is covered by implicitly considering all primal constraints when selecting the next coordinate.

Keywords: Semidefinite programming, non-convex quadratic integer optimization, coordinate descent method

Category 1: Integer Programming

Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming )


Download: [PDF]

Entry Submitted: 03/08/2016
Entry Accepted: 03/08/2016
Entry Last Modified: 03/08/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society