Optimization Online


A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations

Christoph Helmberg (helmberg***at***zib.de)

Abstract: The recent spectral bundle method allows to compute, within reasonable time, approximate dual solutions of large scale semidefinite quadratic 0-1 programming relaxations. We show that it also generates a sequence of primal approximations that converge to a primal optimal solution. Separating with respect to these approximations gives rise to a cutting plane algorithm that converges to the optimal solution under reasonable assumptions on the separation oracle and the feasible set. We have implemented a practical variant of the cutting plane algorithm for improving semidefinite relaxations of constrained quadratic 0-1 programming problems by odd-cycle inequalities. We also consider separating odd-cycle inequalities with respect to a larger support than given by the cost matrix and present a heuristic for selecting this support. Our preliminary computational results for max-cut instances on toroidal grid graphs and balanced bisection instances indicate that warm start is highly efficient and that enlarging the support may sometimes improve the quality of relaxations considerably.

Keywords: bisection, equicut, max-cut, semidefinite programming, spectral bundle method, subgradient method, quadratic 0-1 programming

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

Category 2: Integer Programming (Cutting Plane Approaches )

Category 3: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Citation: ZIB-Report 01-26, October 2001 Konrad-Zuse-Zentrum fuer Inforamtionstechnik Berlin Takustrasse 7 D-14195 Berlin Germany

Download: [Compressed Postscript][PDF]

Entry Submitted: 10/26/2001
Entry Accepted: 10/26/2001
Entry Last Modified: 10/26/2001

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 Programming Society