Strong duality for a trust-region type relaxation of the quadratic assignment problem

✍ Scribed by Kurt Anstreicher; Xin Chen; Henry Wolkowicz; Ya-Xiang Yuan

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 115 KB
• Volume: 301
• Category: Article
• ISSN: 0024-3795
• DOI: 10.1016/s0024-3795(99)00205-0

✦ Synopsis

Lagrangian duality underlies many efficient algorithms for convex minimization problems.

A key ingredient is strong duality. Lagrangian relaxation also provides lower bounds for non-convex problems, where the quality of the lower bound depends on the duality gap. Quadratically constrained quadratic programs (QQPs) provide important examples of non-convex programs. For the simple case of one quadratic constraint (the trust-region subproblem) strong duality holds. In addition, necessary and sufficient (strengthened) second-order optimality conditions exist. However, these duality results already fail for the two trust-region subproblem. Surprisingly, there are classes of more complex, non-convex QQPs where strong duality holds. One example is the special case of orthogonality constraints, which arise naturally in relaxations for the quadratic assignment problem (QAP). In this paper we show that strong duality also holds for a relaxation of QAP where the orthogonality constraint is replaced by a semidefinite inequality constraint. Using this strong duality result, and semidefinite duality, we develop new trust-region type necessary and sufficient optimality conditions