Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
From MaRDI portal
Publication:3563918
DOI10.1137/080736090zbMath1197.90315OpenAlexW2113432563WikidataQ59241566 ScholiaQ59241566MaRDI QIDQ3563918
Guoyin Li, Gue Myung Lee, Vaithilingam Jeyakumar
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080736090
quadratic optimizationglobal optimality conditionsalternative theoremstrust-region problemsquadratic inequality systems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Unnamed Item ⋮ Robust canonical duality theory for solving nonconvex programming problems under data uncertainty ⋮ Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique ⋮ Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ Theorems of the alternative revisited and some extensions of Yuan's lemma ⋮ Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming ⋮ A theorem of the alternative with an arbitrary number of inequalities and quadratic programming ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Toward nonquadratic S-lemma: new theory and application in nonconvex optimization ⋮ Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems ⋮ Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition ⋮ Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty ⋮ Global error bounds for piecewise convex polynomials ⋮ Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations ⋮ Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications ⋮ Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem ⋮ A note on nonconvex minimax theorem with separable homogeneous polynomials ⋮ Hidden conic quadratic representation of some nonconvex quadratic optimization problems ⋮ Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Unnamed Item ⋮ Robust duality for generalized convex programming problems under data uncertainty ⋮ Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization ⋮ Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Theorems of the alternative for inequality systems of real polynomials ⋮ A new class of alternative theorems for SOS-convex inequalities and robust optimization ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality ⋮ A Note on Polynomial Solvability of the CDT Problem ⋮ Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations ⋮ Some results for quadratic problems with one or two quadratic constraints ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints ⋮ Global optimality condition for quadratic optimization problems under data uncertainty ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization ⋮ Global optimality conditions for nonlinear programming problems with linear equality constraints ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem ⋮ S-lemma with equality and its applications
