A comparison of constraint qualifications in infinite-dimensional convex programming revisited

Recommendations

A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
Generalizations of Slater's constraint qualification for infinite convex programs
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
scientific article; zbMATH DE number 18663

Cited in

(29)

Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
Generalizations of Slater's constraint qualification for infinite convex programs
Fenchel duality in infinite-dimensional setting and its applications.
A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
An alternative formulation for a new closed cone constraint qualification
Necessary and sufficient conditions for stable conjugate duality
Weaker conditions for subdifferential calculus of convex functions
Generalized differentiation and duality in infinite dimensions under polyhedral convexity
Existence and characterization of conditional density projections
A new conical regularization for some optimization and optimal control problems: convergence analysis and finite element discretization
On optimality conditions for quasi-relative efficient solutions in set-valued optimization
A Comparison of Some Recent Regularity Conditions for Fenchel Duality
A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
Gradient methods and conic least-squares problems
A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
A simple constraint qualification in infinite dimensional programming
scientific article; zbMATH DE number 2158983 (Why is no real title available?)
On the intrinsic core of convex cones in real linear spaces
On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
New Farkas-type constraint qualifications in convex infinite programming
Duality and Farkas-type results for DC fractional programming with DC constraints
Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
Revisiting some rules of convex analysis
On duality theory in vector spaces without topology via algebraic core
About the maximal monotonicity of the generalized sum of two maximal monotone operators
Duality for -variational inequalities via the subdifferential calculus
On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
On extension results for n-cyclically monotone operators in reflexive Banach spaces

This page was built for publication: A comparison of constraint qualifications in infinite-dimensional convex programming revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243939)