A simple closure condition for the normal cone intersection formula

DOI10.1090/S0002-9939-04-07844-XzbMath1065.46055OpenAlexW1517224067MaRDI QIDQ4654124

Vaithilingam Jeyakumar, Regina Sandra Burachik

Publication date: 1 March 2005

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-04-07844-x

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items

An approach for the convex feasibility problem via monotropic programming ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ Stability in Affine Optimal Control Problems Constrained by Semilinear Elliptic Partial Differential Equations ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Unnamed Item ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty ⋮ Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation ⋮ Constraint qualifications characterizing Lagrangian duality in convex optimization ⋮ Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance ⋮ Strengthened splitting methods for computing resolvents ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ Generalized Fenchel's conjugation formulas and duality for abstract convex functions ⋮ Revisiting some rules of convex analysis ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ The strong conical hull intersection property for convex programming ⋮ 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 ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Stable strong Fenchel and Lagrange duality for evenly convex optimization problems ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming

Cites Work

• Generalizations of Slater's constraint qualification for infinite convex programs
• On the closedness of the algebraic difference of closed convex sets.
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• A simple constraint qualification in infinite dimensional programming
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• On Projection Algorithms for Solving Convex Feasibility Problems
• Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
• Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
• An Intersection Formula for the Normal Cone Associated with the Hypertangent Cone
• Duality and infinite dimensional optimization
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item