Download:
|
by Samuel Burer, Renato D. C. Monteiro, Yin Zhang
http://www.caam.rice.edu/~zhang/reports/tr0033.ps
Add To MetaCart
Abstract:
Semidefinite relaxation for certain discrete optimization problems involves replacing a vector-valued variable by a matrix-valued one, producing a convex program while increasing the number of variables by an order of magnitude. As useful as it is in theory, this approach encounters difficulty in practice as problem size increases. In this paper, we propose a ranktwo relaxation approach and construct continuous optimization heuristics applicable to some binary quadratic programs, including primarily the Max-Cut problem but also others such as the Max-Bisection problem. A computer code based on our rank-two relaxation heuristics is compared with two state-of-the-art semidefinite programming codes. We will report some rather intriguing computational results on a large set of test problems and discuss their ramifications. Keywords: Binary quadratic programs, Max-Cut and Max-Bisection, semidefinite relaxation, rank-two relaxation, continuous optimization heuristics.
Citations
|
574
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
221
|
On the Shannon capacity of a graph
– Lov'asz
- 1979
|
|
82
|
Solving large-scale sparse semidefinite programs for combinatorial optimization
– Benson, Ye, et al.
|
|
77
|
The maximum clique problem
– Bomze, Budinich, et al.
- 1999
|
|
73
|
A spectral bundle method for semidefinite programming
– HELMBERG, RENDL
- 2000
|
|
60
|
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
– FUJISAWA, KOJIMA, et al.
- 1997
|
|
41
|
Rendl: Nonpolyhedral relaxations of graph-bisection problems
– Poljak, F
- 1992
|
|
34
|
Exploiting sparsity in semidefinite programming via matrix completion I: general framework
– FUKUDA, KOJIMA, et al.
- 1999
|
|
33
|
Cones of matrices and set functions and 0-1 optimization
– Lov'asz, Schrijver
- 1991
|
|
21
|
Solving semidefinite programs via nonlinear programming. Part I: Transformations and derivatives
– Burer, Monteiro, et al.
- 1999
|
|
20
|
A projected gradient algorithm for solving the maxcut SDP relaxation
– Burer, Monteiro
- 1998
|
|
18
|
Solving some large scale semidefinite programs via the conjugate residual method
– Toh, Kojima
- 2000
|
|
17
|
Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver
– Choi, Ye
- 2000
|
|
17
|
Design and performance of parallel and distributed approximation algorithms for maxcut
– Homer, Peinado
- 1995
|
|
16
|
Interior-Point Algorithms for Semidefinite Programming Based on A Nonlinear Programming Formulation
– Burer, Monteiro, et al.
|
|
11
|
Quadratic optimization problems. Soviet
– Shor
- 1987
|
|
9
|
On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems
– Vanderbei, Benson
- 1999
|
|
6
|
Private communication
– Choi
- 2000
|
|
6
|
Improved algorithms for Max K-cut and Max bisection
– Frieze, Jerrum
- 1997
|
|
4
|
A note on efficient computation of the gradient in semidefinite programming," Working
– Vavasis
- 1999
|
|
3
|
the website: http://dimacs.rutgers.edu/Challenges/Seventh/Instances
– See
|
|
3
|
A .699-Approximation Algorithm for Max-Bisection. Working paper
– Ye
- 2000
|
|
1
|
and Frauke Liers. Private communication
– Juenger
- 2000
|
