ADMM for the SDP relaxation of the QAP
Authors:
Preprint
Abstract
The semidefinite programming (SDP) relaxation has proven to be extremely strong for many hard discrete optimization problems. This is in particular true for the quadratic assignment problem (QAP), arguably one of the hardest NP-hard discrete optimization problems. There are several difficulties that arise in efficiently solving the SDP relaxation, e.g.,~increased dimension; inefficiency of the current primal-dual interior point solvers in terms of both time and accuracy; and difficulty and high expense in adding cutting plane constraints. We propose using the alternating direction method of multipliers (ADMM) to solve the SDP relaxation. This first order approach allows for inexpensive iterations, a method of cheaply obtaining low rank solutions, as well a trivial way of adding cutting plane inequalities. When compared to current approaches and current best available bounds we obtain remarkable robustness, efficiency and improved bounds.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problemComputational Optimization and Applications, 2015
- Alternating direction augmented Lagrangian methods for semidefinite programmingMathematical Programming Computation, 2010
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problemMathematical Programming, 2008
- Bounds for the quadratic assignment problem using the bundle methodMathematical Programming, 2006
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 2004
- Recent advances in the solution of quadratic assignment problemsMathematical Programming, 2003
- A new bound for the quadratic assignment problem based on convex quadratic programmingMathematical Programming, 2001
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- QAPLIB – A Quadratic Assignment Problem LibraryJournal of Global Optimization, 1997
- QAPLIB-A quadratic assignment problem libraryEuropean Journal of Operational Research, 1991