A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
From MaRDI portal
Publication:2248753
The quadratic optimization problem with finite many linear equality and a single non-convex quadratic inequality constraints is studied from more points of view. First, a characterization of a separation between a convex set and an open cone is derived in terms of the convexity of the conic hull of some related sets. A relaxed version of Dines theorem is derived in this particular framework. A geometric characterization of the strong duality is obtained without convexity or Slater assumptions, leading to necessary and sufficient optimality condition for this kind of problems. Refinements and improvements of more known results are obtained, together with some necessary conditions of existence.
Recommendations
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Strong duality in cone constrained nonconvex optimization
- Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality
Cites work
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- A Frank--Wolfe type theorem for convex polynomial programs
- A Survey of the S-Lemma
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- An alternative formulation for a new closed cone constraint qualification
- An optimal alternative theorem and applications to mathematical programming
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Computing Optimal Locally Constrained Steps
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Convexity of quadratic transformations and its use in control and optimization
- Existence of global minima for constrained optimization
- Existence of optimal solutions and duality results under weak conditions
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 3368525 (Why is no real title available?)
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Matrix Analysis
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- Necessary and sufficient conditions for S-lemma and~nonconvex quadratic optimization
- Newton’s Method with a Model Trust Region Modification
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On extensions of the Frank-Wolfe theorems
- On Quadratic Programming
- On the mapping of quadratic forms
- On the S-procedure and some variants
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Some convex programs without a duality gap
- Some equivalent results with Yakubovich's S-Lemma
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
- Transmit beamforming for physical-layer multicasting
- Two extensions to Finsler's recurring theorem
- Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen
Cited in
(21)- A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
- Strong duality for general quadratic programs with quadratic equality constraints
- On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Quadratic fractional programming under asymptotic analysis
- Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
- Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
- An eaves type theorem for quadratic fractional programming problems and its applications
- Zero-scale asymptotic functions and quasiconvex optimization
- The q-asymptotic function in c-convex analysis
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Characterizing optimality for a class of nonconvex quadratic robust optimization problems bilaterally quadratically constrained under interval uncertainty
- A non-polyhedral extension of the Frank-Wolfe theorem to cubic optimization
- Constant duality gap and applications
- Semi-continuous quadratic optimization: existence conditions and duality scheme
This page was built for publication: A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248753)
