Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints

DOI10.1007/s10898-006-9022-3zbMath1131.90060OpenAlexW2026514175MaRDI QIDQ2433932

Alexander Rubinov, Zhi-You Wu, Vaithilingam Jeyakumar

Publication date: 31 October 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9022-3

zbMATH Keywords

Weighted least squaresQuadratic optimizationBivalent programsBox constraintsGlobal optimality conditionsNon-convex minimization

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 (35)

Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ A note on sufficient global optimality conditions for fixed charge quadratic programs ⋮ Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems ⋮ Global optimality conditions for fixed charge quadratic programs ⋮ Sufficient conditions for global optimality of semidefinite optimization ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ Necessary global optimality conditions for nonlinear programming problems with polynomial constraints ⋮ Sufficient global optimality conditions for weakly convex minimization problems ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Global optimality conditions and optimization methods for quadratic assignment problems ⋮ Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Global sufficient optimality conditions for a special cubic minimization problem ⋮ Global optimality conditions for cubic minimization problem with box or binary constraints ⋮ Global minimization of difference of quadratic and convex functions over box or binary constraints ⋮ A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization ⋮ Global optimality conditions and optimization methods for quadratic knapsack problems ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators ⋮ Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints ⋮ Global optimality conditions for some classes of optimization problems ⋮ On second-order optimality conditions for nonlinear programming ⋮ Global optimality of quadratic minimization over symmetric polytopes ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Unified global optimality conditions for smooth minimization problems with mixed variables ⋮ Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions ⋮ Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma ⋮ Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming ⋮ On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball ⋮ New Kuhn-Tucker sufficiency for global optimality via convexification ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems ⋮ Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators ⋮ Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality ⋮ CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient global optimality conditions for bivalent quadratic optimization
• Constrained global optimization: algorithms and applications
• Conditions for global optimality. II
• Primal-relaxed dual global optimization approach
• Handbook of global optimization
• A note on diagonally dominant matrices
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Construction of test problems in quadratic bivalent programming
• Abstract convexity and global optimization

This page was built for publication: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints