Strong duality for a trust-region type relaxation of the quadratic assignment problem
From MaRDI portal
Publication:1970512
DOI10.1016/S0024-3795(99)00205-0zbMath0953.90034MaRDI QIDQ1970512
Xin Chen, Kurt M. Anstreicher, Henry Wolkowicz, Ya-Xiang Yuan
Publication date: 19 June 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
quadratic assignment problemsecond-order optimality conditionsstrong dualityconvex minimization problemsLagrangian dualitytrust-region subproblemsemidefinite inequality constraint
Semidefinite programming (90C22) Quadratic programming (90C20) Discrete location and assignment (90B80)
Related Items
A survey for the quadratic assignment problem, A survey of hidden convex optimization, Global optimization of a class of nonconvex quadratically constrained quadratic programming problems, A new semidefinite programming relaxation scheme for a class of quadratic matrix problems, Moment inequalities for sums of random matrices and their applications in optimization, Semidefinite programming for discrete optimization and matrix completion problems, Sufficient global optimality conditions for bivalent quadratic optimization, Minimizing the object space error for pose estimation: towards the most efficient algorithm, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid, Strong duality for general quadratic programs with quadratic equality constraints, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
Uses Software
