Global optimality of quadratic minimization over symmetric polytopes

DOI10.1080/02331930701617395zbMath1172.90484OpenAlexW2059019218MaRDI QIDQ5426965

Nguyen Quang Huy, Vaithilingam Jeyakumar

Publication date: 16 November 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701617395

zbMATH Keywords

Necessary optimality conditionsSufficient conditionsBox constraintsquadratic nonconvex minimizationSymmetric polytopes

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)

Cites Work

• Sufficient global optimality conditions for bivalent quadratic optimization
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Conditions for global optimality. II
• Computational experience with a new class of convex underestimators: Box-constrained NLP problems
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Iterative convex quadratic approximation for global optimization in protein docking
• Nonconvex piecewise-quadratic underestimation for global minimization
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints

This page was built for publication: Global optimality of quadratic minimization over symmetric polytopes