A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming

DOI10.1137/0328051zbMATH Open0713.49042OpenAlexW2044306516MaRDI QIDQ3198441FDOQ3198441

Authors: M. Seetharama Gowda, Marc Teboulle 

Publication date: 1990

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0328051

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

zbMATH Keywords

constraint qualificationsduality theoryinfinite-dimensional convex programs

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Existence theories for problems in abstract spaces (49J27)

Cited In (43)

• On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
• The perturbed proximal point algorithm and some of its applications
• Duality and its applications to optimality conditions with nonsolid cones
• Revisiting some rules of convex analysis
• A Comparison of Some Recent Regularity Conditions for Fenchel Duality
• The perturbed Tikhonov's algorithm and some of its applications
• Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• Constrained best approximation in Hilbert space. II
• A simple constraint qualification in infinite dimensional programming
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• On optimality conditions for quasi-relative efficient solutions in set-valued optimization
• Title not available (Why is that?)
• Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
• Revisiting some duality theorems via the quasirelative interior in convex optimization
• Existence and characterization of conditional density projections
• AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
• Gradient methods and conic least-squares problems
• A simple closure condition for the normal cone intersection formula
• Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
• Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
• Fenchel duality in infinite-dimensional setting and its applications.
• Generalizations of Slater's constraint qualification for infinite convex programs
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
• On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
• An alternative formulation for a new closed cone constraint qualification
• New Farkas-type constraint qualifications in convex infinite programming
• A new geometric condition for Fenchel's duality in infinite dimensional spaces
• A constraint qualification for convex programming
• A comparison of alternative c-conjugate dual problems in infinite convex optimization
• Some formulae of convex and nonconvex duality
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
• Bounded linear regularity of convex sets in Banach spaces and its applications
• Multi-composition rule of convex subdifferential calculus
• Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
• On extension results for \(n\)-cyclically monotone operators in reflexive Banach spaces
• Constraint qualification with Schauder basis for infinite programming problems
• On subdifferential calculus for set-valued mappings and optimality conditions
• Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
• Duality and Farkas-type results for DC fractional programming with DC constraints

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)