Minimum L1-distance projection onto the boundary of a convex set: Simple characterization

Simple item page
dc.creatorTuenter, Hans J. H.
dc.date2006-06-18
dc.date.accessioned2026-07-07T07:17:25Z
dc.date.available2026-07-07T07:17:25Z
dc.descriptionWe show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a polyhedron leads to either an elementary minmax problem or a set of easily solved linear programs, depending upon whether the polyhedron is given as the intersection of a set of half spaces or as the convex hull of a set of extreme points. The outcome is an easier and more straightforward derivation of the special case results given in a recent paper by Briec.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/0606426
dc.identifierhttp://arxiv.org/abs/math/0606426
dc.identifierJournal of Optimization Theory and Applications, 112(2):441-445, February 2002
dc.identifierdoi:10.1023/A:1013614208950
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113931
dc.subjectOptimization and Control
dc.subject90C25
dc.titleMinimum L1-distance projection onto the boundary of a convex set: Simple characterization
dc.typetext

Files

Collections

arXiv