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

170Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 1999.

Cite

CITATION STYLE

APA

Bauschke, H. H., Borwein, J. M., & Li, W. (1999). Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization. Mathematical Programming, Series B, 86(1), 135–160. https://doi.org/10.1007/s101070050083

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free