An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
type: Item
instance of: scholarly article
title: An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
zbMATH Open document ID: 0814.90063
DOI: 10.1016/0167-6377(94)90019-1
author: Naoki Makimoto
author: Ikuo Nakagawa
author: Akihisa Tamura
published in: Operations Research Letters
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 709965
zbMATH Keywords: minimum norm point problem
zbMATH Keywords: convex hull
zbMATH Keywords: two-dimensional case
MaRDI profile type: Publication
full work available at URL: 0167-6377(94)90019-1
OpenAlex ID: W2025747217
cites work: Submodular systems and related topics
cites work: A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
cites work: Linearly constrained estimation by mathematical programming
cites work: Finding the Point of a Polyhedron Closest to the Origin
cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
cites work: A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
cites work: An interior point algorithm for large scale portfolio optimization
cites work: Finding the nearest point in A polytope
description: scientific article; zbMATH DE number 709965