A comparison of constraint qualifications in infinite-dimensional convex programming revisited
From MaRDI portal
Publication:4243939
DOI10.1017/S033427000001095XzbMath0926.90077OpenAlexW2120729074MaRDI QIDQ4243939
Publication date: 24 May 1999
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s033427000001095x
Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)
Related Items (21)
Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors ⋮ On optimality conditions for quasi-relative efficient solutions in set-valued optimization ⋮ A Comparison of Some Recent Regularity Conditions for Fenchel Duality ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ Gradient methods and conic least-squares problems ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Generalized differentiation and duality in infinite dimensions under polyhedral convexity ⋮ Fenchel duality in infinite-dimensional setting and its applications. ⋮ Revisiting some rules of convex analysis ⋮ On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces ⋮ About the maximal monotonicity of the generalized sum of two maximal monotone operators ⋮ On extension results for \(n\)-cyclically monotone operators in reflexive Banach spaces ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ 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 ⋮ EXISTENCE AND CHARACTERIZATION OF CONDITIONAL DENSITY PROJECTIONS ⋮ Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces ⋮ Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints ⋮ A New Conical Regularization for Some Optimization and Optimal Control Problems: Convergence Analysis and Finite Element Discretization
This page was built for publication: A comparison of constraint qualifications in infinite-dimensional convex programming revisited
