Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators

DOI10.1080/02331930801951199zbMath1211.90234OpenAlexW2087212699MaRDI QIDQ3553760

Nguyen Quang Huy, Vaithilingam Jeyakumar

Publication date: 21 April 2010

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationoptimality conditionsbox constraintssmooth nonlinear programming problemsdiscrete constraints

Mathematics Subject Classification ID

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

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
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• 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 Quadratic Optimization Problems with Binary Constraints
• Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
• CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
• Characterization of convexifiable functions

This page was built for publication: Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators