A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
From MaRDI portal
Publication:2248753
DOI10.1007/S10107-013-0647-YzbMATH Open1327.90305OpenAlexW1977405258MaRDI QIDQ2248753FDOQ2248753
Authors: Gabriel Cárcamo, Fabián Flores-Bazan 
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/127847
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
Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Cites Work
- Matrix Analysis
- A Survey of the S-Lemma
- An alternative formulation for a new closed cone constraint qualification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Convexity of quadratic transformations and its use in control and optimization
- Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Title not available (Why is that?)
- On the mapping of quadratic forms
- On the S-procedure and some variants
- Some equivalent results with Yakubovich's \(S\)-Lemma
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- A Frank--Wolfe type theorem for convex polynomial programs
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Computing Optimal Locally Constrained Steps
- On extensions of the Frank-Wolfe theorems
- Existence of optimal solutions and duality results under weak conditions
- Newton’s Method with a Model Trust Region Modification
- Existence of global minima for constrained optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- An optimal alternative theorem and applications to mathematical programming
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Some convex programs without a duality gap
- On Quadratic Programming
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Transmit beamforming for physical-layer multicasting
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- Two extensions to Finsler's recurring theorem
Cited In (16)
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
- Title not available (Why is that?)
- Semi-continuous quadratic optimization: existence conditions and duality scheme
- Title not available (Why is that?)
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Title not available (Why is that?)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
- Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
- The q-asymptotic function in c-convex analysis
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- Title not available (Why is that?)
- On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
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)
