Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization

Abstract.The strong conical hull intersection property and bounded linear regularity are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. These fundamental notions occur in various branches of convex optimization (constrained approximation, convex feasibility problems, linear inequalities, for instance). It is shown that the standard constraint qualification from convex analysis implies bounded linear regularity, which in turn yields the strong conical hull intersection property. Jameson’s duality for two cones, which relates bounded linear regularity to property (G), is re-derived and refined. For polyhedral cones, a statement dual to Hoffman’s error bound result is obtained. A sharpening of a result on error bounds for convex inequalities by Auslender and Crouzeix is presented. Finally, for two subspaces, property (G) is quantified by the angle between the subspaces.

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

[2]  Alfred Auslender,et al.  Global Regularity Theorems , 1988, Math. Oper. Res..

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

[4]  Wu Li,et al.  Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities , 1997, SIAM J. Optim..

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

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

[7]  James V. Burke,et al.  A Unified Analysis of Hoffman's Bound via Fenchel Duality , 1996, SIAM J. Optim..

[8]  K. Friedrichs.  On certain inequalities and characteristic value problems for analytic functions and for functions of two variables , 1937 .

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

[10]  Frank Deutsch,et al.  Interpolation from a Convex Subset of Hilbert Space: A Survey of Some Recent Results , 1995 .

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

[12]  Frank Deutsch,et al.  Constrained best approximation in Hilbert space III. Applications ton-convex functions , 1996 .

[13]  Heinz H. Bauschke,et al.  Projection algorithms and monotone operators , 1996 .

[14]  S. M. Robinson.  An Application of Error Bounds for Convex Programming in a Linear Space , 1975 .

[15]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[16]  Wu Li,et al.  Asymptotic constraint qualifications and global error bounds for convex inequalities , 1999, Math. Program..

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

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

[19]  Paul Tseng,et al.  Metric regularity, strong CHIP, and CHIP are distinct properties , 2000 .

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

[21]  Olvi L. Mangasarian,et al.  A Condition Number for Differentiable Convex Inequalities , 1985, Math. Oper. Res..

[22]  R. Holmes.  Geometric Functional Analysis and Its Applications , 1975 .

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

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

[25]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

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

[27]  G. Jameson.  Topology and Normed Spaces , 1974 .

[28]  Stephen M. Robinson,et al.  Regularity and Stability for Convex Multivalued Functions , 1976, Math. Oper. Res..