Distance to the intersection of normal sets and applications
From MaRDI portal
The authors show that the distance to the intersection of an arbitrary collection of normal sets is equal to the supremum of distances to the sets of the intersection. They also apply this result to study the distance to the solution set of inequalities involving increasing functions which are convex along rays starting from zero or, in particular, are positively homogeneous.
Recommendations
Cites work
Cited in
(10)- On the infimum of a quasiconvex vector function over an intersection
- Determining the interset distance
- Distance to the intersection of two sets
- scientific article; zbMATH DE number 9815 (Why is no real title available?)
- The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them
- scientific article; zbMATH DE number 2202900 (Why is no real title available?)
- Rendezvous numbers in normed spaces
- scientific article; zbMATH DE number 3358584 (Why is no real title available?)
- Boundedly connected sets and the distance to the intersection of two sets
- Normal cones to infinite intersections
This page was built for publication: Distance to the intersection of normal sets and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508649)