Bounded Linear Regularity, Strong CHIP, and CHIP are Distinct Properties

Bounded linear regularity, the strong conical hull intersection property (strong CHIP), and the conical hull intersection property (CHIP) are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. It was shown recently that these properties are fundamental in several branches of convex optimization, including convex feasibility problems, error bounds, Fenchel duality, and constrained approximation. It was known that regularity implies strong CHIP, which in turn implies CHIP; moreover, the three properties always hold for subspaces. The question whether or not converse implications are true for general convex sets was open.

[1]  W. Li,et al.  Fenchel Duality and the Strong Conical Hull Intersection Property , 1999 .

[2]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[3]  Charles K. Chui,et al.  Constrained best approximation in Hilbert space, II , 1992 .

[4]  Heinz H. Bauschke,et al.  Conical open mapping theorems and regularity , 1999 .

[5]  F. Deutsch.  The Angle Between Subspaces of a Hilbert Space , 1995 .

[6]  Adrian S. Lewis,et al.  Convex Analysis on the Hermitian Matrices , 1996, SIAM J. Optim..

[7]  Heinz H. Bauschke,et al.  On the convergence of von Neumann's alternating projection algorithm for two sets , 1993 .

[8]  Wu Li,et al.  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 , 1999, SIAM J. Optim..

[9]  Krzysztof C. Kiwiel,et al.  Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings , 1997, SIAM J. Optim..

[10]  Frank Deutsch,et al.  A Dual Approach to Constrained Interpolationfrom a Convex Subset of Hilbert Space , 1997 .

[11]  Heinz H. Bauschke,et al.  The method of cyclic projections for closed convex sets in Hilbert space , 1997 .

[12]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[13]  Andrew Bakan,et al.  Moreau-Rockafellar equality for sublinear functionals , 1989 .

[14]  Andrew Bakan,et al.  Nonempty classes of normal pairs of cones of transfinite order , 1989 .

[15]  Heinz H. Bauschke,et al.  Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization , 1999, Math. Program..

[16]  Jong-Shi Pang,et al.  Error bounds in mathematical programming , 1997, Math. Program..

[17]  G. Jameson.  The Duality of Pairs of Wedges , 1972 .

[18]  A. Lewis,et al.  Error Bounds for Convex Inequality Systems , 1998 .