Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

DOI10.1007/S10107-006-0012-5zbMath1206.90178OpenAlexW2091480518MaRDI QIDQ985310

Vaithilingam Jeyakumar, Zhi-You Wu, Alexander Rubinov

Publication date: 21 July 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0012-5

zbMATH Keywords

Lagrange multipliersbinary constraints

Mathematics Subject Classification ID

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

Related Items (50)

Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ Generalized subdifferentials of the sign change counting function ⋮ Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems ⋮ 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 ⋮ Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique ⋮ Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ Global optimality conditions for fixed charge quadratic programs ⋮ Sufficient conditions for global optimality of semidefinite optimization ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Q-subdifferential and Q-conjugate for global optimality ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Necessary global optimality conditions for nonlinear programming problems with polynomial constraints ⋮ Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition ⋮ Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty ⋮ Sufficient global optimality conditions for weakly convex minimization problems ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems ⋮ Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems ⋮ Global sufficient optimality conditions for a special cubic minimization problem ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Global optimality conditions for cubic minimization problem with box or binary constraints ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems ⋮ On quadratically constrained quadratic optimization problems and canonical duality theory ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators ⋮ Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint ⋮ On stability of solutions to parametric generalized affine variational inequalities ⋮ Semidefinite program duals for separable polynomial programs involving box constraints ⋮ Global optimality conditions for some classes of optimization problems ⋮ 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 ⋮ A filled function method for quadratic programs with binary constraints† ⋮ Characteristics of semi-convex frontier optimization ⋮ 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 ⋮ Global optimality conditions for mixed nonconvex quadratic programs† ⋮ Global optimality condition for quadratic optimization problems under data uncertainty ⋮ On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball ⋮ Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality ⋮ Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint ⋮ Global optimality conditions for nonlinear programming problems with linear equality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient global optimality conditions for bivalent quadratic optimization
• On the S-procedure and some variants
• Global optimality conditions for nonconvex optimization
• Conditions for global optimality. II
• Handbook of global optimization
• Necessary and sufficient global optimality conditions for convex maximization revisited
• Dual conditions characterizing optimality for convex multi-objective programs.
• A note on diagonally dominant matrices
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Convexity of quadratic transformations and its use in control and optimization
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• The strong conical hull intersection property for convex programming
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Construction of test problems in quadratic bivalent programming
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
• Abstract convexity and global optimization

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