Necessary and sufficient conditions for S-lemma and~nonconvex quadratic optimization
From MaRDI portal
Publication:374638
DOI10.1007/S11081-008-9076-9zbMATH Open1273.90141OpenAlexW2058387991WikidataQ59241577 ScholiaQ59241577MaRDI QIDQ374638FDOQ374638
Authors: Nguyen Quang Huy, G. Li, V. Jeyakumar 
Publication date: 24 October 2013
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-008-9076-9
Recommendations
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- S-lemma with equality and its applications
- A Survey of the S-Lemma
- A sufficient conditions for global quadratic optimization
Slater's condition\(S\)-lemmanecessary and sufficient global optimality conditionsnonconvex quadratic optimizationregularized \(S\)-lemma
Cites Work
- A Survey of the S-Lemma
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Convexity of quadratic transformations and its use in control and optimization
- On the Field of Values of a Matrix
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Title not available (Why is that?)
- On Cones of Nonnegative Quadratic Functions
- On the S-procedure and some variants
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Multivariate Nonnegative Quadratic Mappings
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- The strong conical hull intersection property for convex programming
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- Liberating the subgradient optimality conditions from constraint qualifications
Cited In (28)
- A note on nonconvex minimax theorem with separable homogeneous polynomials
- Semidefinite program duals for separable polynomial programs involving box constraints
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- S-lemma with equality and its applications
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Quadratic program on a structured nonconvex set
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- On stability of solutions to parametric generalized affine variational inequalities
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Robust duality for generalized convex programming problems under data uncertainty
- Toward nonquadratic S-lemma: new theory and application in nonconvex optimization
- On fractional quadratic optimization problem with two quadratic constraints
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- A Survey of the S-Lemma
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Non-quadratic extension of homogeneous S-lemma and its applications in optimization
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Affinely adjustable robust optimization for radiation therapy under evolving data uncertainty via semi-definite programming
This page was built for publication: Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374638)
