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

DOI10.1016/S0024-3795(99)00205-0MaRDI QIDQ1970512zbMATH OpenFDO

Authors Kurt M. Anstreicher, Xin Chen, Henry Wolkowicz, Yaxiang Yuan

Publication date 19 June 2000

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(99)00205-0

zbMATH Keywords

convex minimization problemsLagrangian dualityquadratic assignment problemsecond-order optimality conditionssemidefinite inequality constraintstrong dualitytrust-region subproblem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Quadratic programming (90C20) Semidefinite programming (90C22)

Recommendations

• A note on lack of strong duality for quadratic problems with orthogonal constraints
• Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
• scientific article; zbMATH DE number 714535
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
• On Lagrangian relaxation of quadratic matrix constraints

Cited in

(19)

• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• A note on lack of strong duality for quadratic problems with orthogonal constraints
• Strong duality for general quadratic programs with quadratic equality constraints
• A survey of hidden convex optimization
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
• On Lagrangian relaxation of quadratic matrix constraints
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• scientific article; zbMATH DE number 714535 (Why is no real title available?)
• A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
• Strong duality for generalized trust region subproblem: S-lemma with interval bounds
• Several results on the strong duality of QCQP
• Minimizing the object space error for pose estimation: towards the most efficient algorithm
• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
• Moment inequalities for sums of random matrices and their applications in optimization
• A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
• Semidefinite programming for discrete optimization and matrix completion problems
• Sufficient global optimality conditions for bivalent quadratic optimization
• A survey for the quadratic assignment problem

Describes a project that uses

Uses Software

• GQTPAR

This page was built for publication: Strong duality for a trust-region type relaxation of the quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970512)