A complete characterization of strong duality in nonconvex optimization with a single constraint
From MaRDI portal
Publication:454276
DOI10.1007/s10898-011-9673-6zbMath1284.90076OpenAlexW2000392383MaRDI QIDQ454276
Cristián Vera, Fernando Flores-Bazán, Fabián Flores-Bazan
Publication date: 1 October 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/128148
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
Set-valued systems with infinite-dimensional image and applications, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint, Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap, Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications, Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems, On epsilon-stability in optimization, A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints, Connections between mean-field game and social welfare optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Separation of sets and Wolfe duality
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- An optimal alternative theorem and applications to mathematical programming
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Existence of optimal solutions and duality results under weak conditions
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- An alternative formulation for a new closed cone constraint qualification
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Fenchel and Lagrange duality are equivalent
- Variational Analysis
- Transmit beamforming for physical-layer multicasting
- Quasi-Convex Programming
