Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

DOI10.1007/s10114-011-8351-4zbMath1225.90094MaRDI QIDQ644622

Yong Xia

Publication date: 4 November 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-8351-4

zbMATH Keywords

quadratically constrained quadratic programming; nonconvex programming; quadratic assignment problem; strong duality; polynomial solvability

Mathematics Subject Classification ID

90C20: Quadratic programming

90C27: Combinatorial optimization

49N15: Duality theory (optimization)

Related Items

Minimizing the object space error for pose estimation: towards the most efficient algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• A survey for the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• Recent advances in the solution of quadratic assignment problems
• Strong duality for a trust-region type relaxation of the quadratic assignment problem
• New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
• An efficient continuation method for quadratic assignment problems
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• Second order cone programming relaxation for quadratic assignment problems
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• P-Complete Approximation Problems