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

Computers and Operations Research

Volumn 20, Issue 4, 1993, Pages 363-370

  Sherali, Hanif D ^a   Choi, Gyunghyun ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; LINEAR PROGRAMMING; OPTIMIZATION; STATISTICS;

CLOSET POINT PROBLEMS; CONVEX HULL; DISCRETE POINTS;

OPERATIONS RESEARCH;

EID: 0027588997     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(93)90080-3     Document Type: Article

References (10)

1. Bundle methods in nonsmooth optimization
2. Proximality control in bundle methods for convex nondifferentiable minimization
3. Linear least squares and quadratic programming
4. Finding the point of a polyhedron closest to the origin
5. Finding the nearest point in a polytope
6. An algorithm for finding the shortest element of a polytope set with application to Lagrangian duality
7. Interior path following primal-dual algorithms—part II: convex quadratic programming