An alternative formulation for a new closed cone constraint qualification
From MaRDI portal
Publication:2492444
DOI10.1016/j.na.2005.06.041zbMath1105.46052OpenAlexW2064099700MaRDI QIDQ2492444
Publication date: 9 June 2006
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2005.06.041
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
Duality theorems for separable convex programming without qualifications ⋮ Characterizations via linear scalarization of minimal and properly minimal elements ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ A Lagrange duality approach for multi-composed optimization problems ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Some constraint qualifications for quasiconvex vector-valued systems ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ Stable zero Lagrange duality for DC conic programming ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems ⋮ Constraint qualifications characterizing Lagrangian duality in convex optimization ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ 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 ⋮ The conjugate of the pointwise maximum of two convex functions revisited ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ Revisiting some rules of convex analysis ⋮ On strong and total Lagrange duality for convex optimization problems ⋮ Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities ⋮ Revisiting some duality theorems via the quasirelative interior in convex optimization ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Lagrange multipliers and infinite-dimensional equilibrium problems ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ On biconjugates of infimal functions ⋮ Duality gap of the conic convex constrained optimization problems in normed spaces ⋮ Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints ⋮ Lagrange duality for evenly convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong duality for generalized convex optimization problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- Inequality systems and global optimization
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- A simple closure condition for the normal cone intersection formula
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Farkas-Type Results With Conjugate Functions
