An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

DOI10.1016/0167-6377(94)90019-1zbMath0814.90063OpenAlexW2025747217MaRDI QIDQ1342092

Ikuo Nakagawa, Akihisa Tamura, Naoki Makimoto

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90019-1

zbMATH Keywords

convex hulltwo-dimensional caseminimum norm point problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)

Related Items (1)

An approximate algorithm for computing multidimensional convex hulls

Cites Work

• Linearly constrained estimation by mathematical programming
• An interior point algorithm for large scale portfolio optimization
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
• Submodular systems and related topics
• Finding the nearest point in A polytope
• Finding the Point of a Polyhedron Closest to the Origin
• [https://portal.mardi4nfdi.de/wiki/Publication:5331598 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II]
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]

This page was built for publication: An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane