CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS

DOI10.1142/S021759590700119XzbMath1118.41018OpenAlexW1963950814MaRDI QIDQ3439884

Vaithilingam Jeyakumar, Zhi-You Wu

Publication date: 21 May 2007

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021759590700119x

zbMATH Keywords

linear matrix inequalitiesbox constraintsquadratic optimizationglobal optimalitysufficient condition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)

Related Items (5)

Sufficient conditions for global optimality of semidefinite optimization ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Global minimization of difference of quadratic and convex functions over box or binary constraints ⋮ Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems

Cites Work

• Global optimality conditions for nonconvex optimization
• Necessary and sufficient global optimality conditions for convex maximization revisited
• A polyhedral study of nonconvex quadratic programs with box constraints
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Construction of test problems in quadratic bivalent programming
• Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions

This page was built for publication: CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS