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-yzbMath1327.90305OpenAlexW1977405258MaRDI QIDQ2248753
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
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)
Related Items (12)
Unnamed Item ⋮ Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives ⋮ Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality ⋮ A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities ⋮ Semi-continuous quadratic optimization: existence conditions and duality scheme ⋮ The q-asymptotic function in c-convex analysis ⋮ Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization ⋮ Unnamed Item ⋮ On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Existence of global minima for constrained optimization
- On the S-procedure and some variants
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Some convex programs without a duality gap
- An optimal alternative theorem and applications to mathematical programming
- On extensions of the Frank-Wolfe theorems
- Two extensions to Finsler's recurring theorem
- Existence of optimal solutions and duality results under weak conditions
- A Frank--Wolfe type theorem for convex polynomial programs
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Convexity of quadratic transformations and its use in control and optimization
- An alternative formulation for a new closed cone constraint qualification
- Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen
- Some Equivalent Results with Yakubovich's S-Lemma
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Matrix Analysis
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- Transmit beamforming for physical-layer multicasting
- Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
- On Quadratic Programming
- A Survey of the S-Lemma
- On the mapping of quadratic forms
This page was built for publication: A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
