Dept. of Mathematics and Statistics Okanagan University College Kelowna BC, V1V 1V7 Canada
Centre for Experimental and Constructive Mathematics Dept. of Mathematics Simon Fraser University Burnaby BC, V5A 1S6 Canada
Dept. of Mathematics University of Washington Seattle, WA 98195-4350 U.S.A.
Abstract: 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 <i>subspaces</i>. The question whether or not converse implications are true for general convex sets was open. <br> We show that - even for <i>convex cones</i> - the converse implications need not hold by constructing counter-examples in R<sup>4</sup>.
Classification (MSC2000): 90C25; 46C05, 52A15, 52A20
Full text of the article: