Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
From MaRDI portal
Publication:2413092
DOI10.1007/s10107-016-1078-3zbMath1393.90092OpenAlexW2530269036MaRDI QIDQ2413092
Gabriel Cárcamo, Fabián Flores-Bazan
Publication date: 6 April 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1078-3
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
First- and second-order optimality conditions for quadratically constrained quadratic programming problems ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality ⋮ A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- On zero duality gap in nonconvex quadratic programming problems
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- 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
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Some convex programs without a duality gap
- On standard quadratic optimization problems
- 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
- An alternative formulation for a new closed cone constraint qualification
- Gordan-Type Alternative Theorems and Vector Optimization Revisited
- On the global optimality of generalized trust region subproblems
- Optimality Conditions via Exact Penalty Functions
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Continuous Characterizations of the Maximum Clique Problem
- Strong Duality in Cone Constrained Nonconvex Optimization
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Lagrange Multipliers and Calmness Conditions of Order p
- Enhanced Fritz John Conditions for Convex Programming
- Nonlinear Programming
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
