Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization

DOI10.1023/A:1013614208950zbMath1127.90400arXivmath/0606426MaRDI QIDQ5959917

Hans J. H. Tuenter

Publication date: 11 April 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0606426

zbMATH Keywords

\(L_1\)-normConvex setsminimum distance projection

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Related Items (6)

Least-distance approach for efficiency analysis: a framework for nonlinear DEA models ⋮ On how to properly calculate the Euclidean distance-based measure in DEA ⋮ The distance between two convex sets ⋮ Units of measurement and directional distance functions with optimal endogenous directions in data envelopment analysis ⋮ Directional Distance Functions in DEA with Optimal Endogenous Directions ⋮ Measures of contextuality and non-contextuality

Cites Work

• Minimum distance to the complement of a convex set: Duality result
• Convex Analysis

This page was built for publication: Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization