CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS

DOI10.1142/S021759590700119XMaRDI QIDQ3439884zbMATH OpenOpenAlexFDO

Authors V. Jeyakumar, Zhiyou 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

box constraintsglobal optimalitylinear matrix inequalitiesquadratic optimizationsufficient condition

Mathematics Subject Classification ID

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

Recommendations

• Global optimality conditions for nonconvex minimization problems with quadratic constraints
• Global optimality conditions for quadratic \(0-1\) optimization problems
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• scientific article; zbMATH DE number 7112360
• Global optimality conditions for quadratic optimization problems with binary constraints
• A sufficient conditions for global quadratic optimization
• Global optimality sufficient conditions for quadratic programming problem with inequality constraints
• Global optimality conditions for mixed nonconvex quadratic programs†
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition

Cites work

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

Cited in

(14)

• Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
• Global optimality conditions for quadratic \(0-1\) optimization problems
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
• Global optimality conditions for nonconvex minimization problems with quadratic constraints
• Global optimality sufficient conditions for quadratic programming problem with inequality constraints
• Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
• Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
• Global optimality conditions for mixed nonconvex quadratic programs†
• Sufficient conditions for global optimality of semidefinite optimization
• A sufficient conditions for global quadratic 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
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

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

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