Optimization Online


ADMM for the SDP relaxation of the QAP

Danilo Oliveira(daniloelias***at***famat.ufu.br)
Henry Wolkowicz(hwolkowicz***at***uwaterloo.ca)
Yangyang Xu(yangyang***at***ima.umn.edu)

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: Quadratic assignment problem, semidefinite programming relaxation, alternating direction method of moments, large scale

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Combinatorial Optimization

Category 3: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 12/16/2015
Entry Accepted: 12/16/2015
Entry Last Modified: 12/16/2015

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