ISSN:
1436-4646
Keywords:
Key words: angle – asymptotic constraint qualification – basic constraint qualification – bounded linear regularity – CHIP – conical hull intersection property – convex feasibility problem – convex inequalities – constrained best approximation – error bound – Friedrichs angle – Hoffman’s error bound – linear inequalities – linear regularity – orthogonal projection – property (G) Mathematics Subject Classification (1991): Primary 90C25; Secondary 15A39, 41A29, 46A40, 46C05, 90C31
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s101070050083
Permalink
