Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces

DOI10.1080/02331934.2016.1227980zbMath1370.90183arXiv1308.2520OpenAlexW3098289439MaRDI QIDQ2836093

Zhou Wei, Qing Hai He

Publication date: 7 December 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2520

zbMATH Keywords

Banach spacesconvex setsintersection propertieslinear regularity

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Programming in abstract spaces (90C48) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)

Related Items

On applications of the calmness moduli for multifunctions to error bounds

Cites Work

• Unnamed Item
• Hilbertian convex feasibility problem: Convergence of projection methods
• Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets
• Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Error bounds in mathematical programming
• 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
• Constrained best approximation in Hilbert space
• Strong Abadie CQ, ACQ, calmness and linear regularity
• The strong conical hull intersection property for convex programming
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Strong CHIP for infinite systems of convex sets in normed linear spaces
• Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• Error Bounds for Abstract Linear Inequality Systems
• 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
• Strong CHIP, normality, and linear regularity of convex sets
• The method of projections for finding the common point of convex sets
• The Duality of Pairs of Wedges