A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
From MaRDI portal
Recommendations
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- 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
- A constraint qualification for convex programming
Cited in
(46)- 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
- Constrained best approximation in Hilbert space. II
- The perturbed proximal point algorithm and some of its applications
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Some formulae of convex and nonconvex duality
- Fenchel duality in infinite-dimensional setting and its applications.
- A constraint qualification for convex programming
- Duality and its applications to optimality conditions with nonsolid cones
- Infimal convolution, c -subdifferentiability, and Fenchel duality in evenly convex optimization
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Bounded linear regularity of convex sets in Banach spaces 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
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Existence and characterization of conditional density projections
- On optimality conditions for quasi-relative efficient solutions in set-valued optimization
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- 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
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- A simple constraint qualification in infinite dimensional programming
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A simple closure condition for the normal cone intersection formula
- scientific article; zbMATH DE number 2158983 (Why is no real title available?)
- The perturbed Tikhonov's algorithm and some of its applications
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
- New Farkas-type constraint qualifications in convex infinite programming
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Constraint qualification with Schauder basis for infinite programming problems
- On subdifferential calculus for set-valued mappings and optimality conditions
- Multi-composition rule of convex subdifferential calculus
- Revisiting some rules of convex analysis
- Regularity lost: the fundamental limitations and constraint qualifications in the problems of elastoplasticity
- On duality theory in vector spaces without topology via algebraic core
- Duality for -variational inequalities via the subdifferential calculus
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3198441)
