Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints

DOI10.1017/S1446181100010063zbMath1113.90147OpenAlexW2019729259MaRDI QIDQ3430018

Nguyen Quang Huy, Gue Myung Lee, Vaithilingam Jeyakumar

Publication date: 20 March 2007

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181100010063

zbMATH Keywords

linear matrix inequalitiesbox constraintsglobal optimality conditionsmulti-extremal problemsdiscrete constraintssmooth nonconvex minimisation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A note on sufficient global optimality conditions for fixed charge quadratic programs ⋮ Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems ⋮ 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 of quadratic minimization over symmetric polytopes ⋮ Unified global optimality conditions for smooth minimization problems with mixed variables ⋮ Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming ⋮ New sufficiency for global optimality and duality of mathematical programming problems via underestimators ⋮ Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators

Cites Work

• Sufficient global optimality conditions for bivalent quadratic optimization
• Conditions for global optimality. II
• A note on diagonally dominant matrices
• Semidefinite programming
• Computational experience with a new class of convex underestimators: Box-constrained NLP problems
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Semidefinite optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications