论文信息 - Distance to the intersection of normal sets and applications

Distance to the intersection of normal sets and applications

We show that the distance to the intersection of an arbitrary family of normal sets is equal to the supreimim of distancesof the sets of the intersection. We apply this result to the study of inequalities involving increasing functions that areconvex along rays starting from zero and, in particular, increasing positively homogeneous functions.

Alexander Rubinov | Ivan Singer

[1] A. Hoffmann. The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them , 1992 .

[2] A. M. Rubinov,et al. Increasing Convex-Along-Rays Functions with Applications to Global Optimization , 1999 .

[3] I. Singer. Abstract Convex Analysis , 1997 .

[4] A. M. Rubinov,et al. Best Approximation by Normal and Conormal Sets , 2000 .

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

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

[7] 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..