An alternative formulation for a new closed cone constraint qualification
From MaRDI portal
(Redirected from Publication:2492444)
Recommendations
- Observations of closed cone constraint qualification for quasiconvex programming
- New constraint qualification and conjugate duality for composed convex optimization problems
- Infinite alternative theorems and nonsmooth constraint qualification conditions
- A constraint qualification for convex programming
- Two new weak constraint qualifications and applications
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- 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
- A dual condition for the convex subdifferential sum formula with applications
- A simple closure condition for the normal cone intersection formula
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Farkas-Type Results With Conjugate Functions
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- Generalizations of Slater's constraint qualification for infinite convex programs
- Inequality systems and global optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Strong duality for generalized convex optimization problems
Cited in
(35)- Asymptotic optimality conditions for linear semi-infinite programming
- Stable zero Lagrange duality for DC conic programming
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- On strong and total Lagrange duality for convex optimization problems
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- A closedness condition and its applications to DC programs with convex constraints
- The conjugate of the pointwise maximum of two convex functions revisited
- Necessary and sufficient constraint qualification for surrogate duality
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Characterizations via linear scalarization of minimal and properly minimal elements
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Robust linear semi-infinite programming duality under uncertainty
- Revisiting some rules of convex analysis
- A Lagrange duality approach for multi-composed optimization problems
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On biconjugates of infimal functions
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Lagrange duality for evenly convex optimization problems
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Lagrange multipliers and infinite-dimensional equilibrium problems
- On constraint qualifications of a nonconvex inequality
- Some constraint qualifications for quasiconvex vector-valued systems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Duality theorems for separable convex programming without qualifications
- New constraint qualification and conjugate duality for composed convex optimization problems
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- On set containment characterization and constraint qualification for quasiconvex programming
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
This page was built for publication: An alternative formulation for a new closed cone constraint qualification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492444)
