A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
From MaRDI portal
Publication:2248753
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
- 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?)
- A Frank--Wolfe type theorem for convex polynomial programs
- A Survey of the S-Lemma
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- 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
- 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 Quadratic Programming
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On extensions of the Frank-Wolfe theorems
- On the S-procedure and some variants
- On the mapping of quadratic forms
- 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
(18)- On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
- The q-asymptotic function in c-convex analysis
- A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
- Characterizing optimality for a class of nonconvex quadratic robust optimization problems bilaterally quadratically constrained under interval uncertainty
- Quadratic fractional programming under asymptotic analysis
- An eaves type theorem for quadratic fractional programming problems and its applications
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Zero-scale asymptotic functions and quasiconvex optimization
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Semi-continuous quadratic optimization: existence conditions and duality scheme
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality
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)
