Finding the closest point to the origin in the convex hull of a discrete set of points

DOI10.1016/0305-0548(93)90080-3zbMath0779.90065OpenAlexW2036671010MaRDI QIDQ1260737

Hanif D. Sherali, Gyunghyun Choi

Publication date: 25 August 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90080-3

zbMATH Keywords

convex hullnondifferentiable optimizationillconditioned problems

Mathematics Subject Classification ID

Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An analytical solution to the minimum \(L_ p\)-norm of a hyperplane ⋮ A method of Euclidean centers ⋮ A maximum \(L_p\) distance problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximity control in bundle methods for convex nondifferentiable minimization
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• An approach to nonlinear programming
• Finding the nearest point in A polytope
• Finding the Point of a Polyhedron Closest to the Origin