Finding the closest point to the origin in the convex hull of a discrete set of points
type: Item
instance of: scholarly article
title: Finding the closest point to the origin in the convex hull of a discrete set of points
zbMATH Open document ID: 0779.90065
DOI: 10.1016/0305-0548(93)90080-3
author: Hanif D. Sherali
author: Gyunghyun Choi
published in: Computers \& Operations Research
publication date: 1993-08-25T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 370620
zbMATH Keywords: convex hull
zbMATH Keywords: nondifferentiable optimization
zbMATH Keywords: illconditioned problems
MaRDI profile type: Publication
full work available at URL: 0305-0548(93)90080-3
OpenAlex ID: W2036671010
cites work: Q4182270
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Q4101612
cites work: Finding the Point of a Polyhedron Closest to the Origin
cites work: Finding the nearest point in A polytope
cites work: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
cites work: An approach to nonlinear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: Q3134873
description: scientific article; zbMATH DE number 370620