Strong CHIP for infinite systems of convex sets in normed linear spaces
From MaRDI portal
Publication:3553765
DOI10.1080/02331930801951066zbMath1193.52003OpenAlexW2071205650MaRDI QIDQ3553765
Publication date: 21 April 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930801951066
Normed linear spaces and Banach spaces; Banach lattices (46B99) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items (2)
Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus ⋮ Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
Cites Work
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Fenchel duality and the strong conical hull intersection property
- Regularities and their relations to error bounds
- The strong conical hull intersection property for convex programming
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- 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
- Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces
- Strong CHIP, normality, and linear regularity of convex sets
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
This page was built for publication: Strong CHIP for infinite systems of convex sets in normed linear spaces
