Finding the projection on a polytope: An iterative method

Computers and Mathematics with Applications

Volumn 32, Issue 8, 1996, Pages 33-39

  Llanas, B ^a   Moreno, C ^a  

^a ETSI de Caminos Cd Univ   (Spain)

Author keywords

Iterative algorithms; Polytopes

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; GEOMETRY; MATHEMATICAL MODELS; SET THEORY;

CONVEX HULL; NEAREST POINT ALGORITHMS; POLYTOPES;

ITERATIVE METHODS;

EID: 0030258734     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(96)00164-2     Document Type: Article

References (7)

1. O. Khatib, Real-time obstacle avoidance for manipulators and mobile robots, International Journal of Robotics Research 5, 90-98 (1986).
2. K. Sekitani and Y. Yamamoto, A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes, Mathematical Programming 61, 233-249 (1993).
3. Ph. Wolfe, Finding the nearest point in a polytope, Mathematical Programming 11, 128-149 (1976).
4. D.P. Dobkin and D.G. Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, J. of Algorithms 6, 381-392 (1985).
5. B. Gartner, A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24 (5), 1018-1035 (1995).
6. W.E. Red, Minimum distances for robot task simulation, Robotica 1, 231-238 (1985).
7. J.B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms I, Springer-Verlag, (1993).