A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes |
| |
Authors: | Kazuyuki Sekitani Yoshitsugu Yamamoto |
| |
Institution: | (1) Institute of Socio-Economic Planning, University of Tsukuba, 305 Tsukuba, Ibaraki, Japan |
| |
Abstract: | For a given pair of finite point setsP andQ in some Euclidean space we consider two problems: Problem 1 of finding the minimum Euclidean norm point in the convex hull ofP and Problem 2 of finding a minimum Euclidean distance pair of points in the convex hulls ofP andQ. We propose a finite recursive algorithm for these problems. The algorithm is not based on the simplicial decomposition of convex sets and does not require to solve systems of linear equations. |
| |
Keywords: | Minimum norm point minimum distance pair of points recursive algorithm convex quadratic program |
本文献已被 SpringerLink 等数据库收录! |