Distance to the intersection of normal sets and applications

DOI10.1080/01630560008816970zbMath0969.26010OpenAlexW2001505180MaRDI QIDQ4508649

Ivan Singer, Alexander Rubinov

Publication date: 1 October 2001

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560008816970

zbMATH Keywords

increasing positively homogeneous functionnormal setICAR inequalityincreasing function convex-along-raysIPH inequality

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Convexity of real functions of several variables, generalizations (26B25) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Representation and superposition of functions (26B40) Inequalities involving other types of functions (26D07)

Related Items (3)

Distance to the intersection of two sets ⋮ Boundedly connected sets and the distance to the intersection of two sets ⋮ On the infimum of a quasiconvex vector function over an intersection

Cites Work

• Unnamed Item
• The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them
• On Projection Algorithms for Solving Convex Feasibility Problems
• Best approximation by normal and conormal sets

This page was built for publication: Distance to the intersection of normal sets and applications