论文信息 - Finding the nearest point in A polytope

Finding the nearest point in A polytope

A terminating algorithm is developed for the problem of finding the point of smallest Euclidean norm in the convex hull of a given finite point set in Euclideann-space, or equivalently for finding an “optimal” hyperplane separating a given point from a given finite point set. Its efficiency and accuracy are investigated, and its extension to the separation of two sets and other convex programming problems described.

Philip Wolfe | P. Wolfe

[1] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[2] O. Mangasarian. Linear and Nonlinear Separation of Patterns by Linear Programming , 1965 .

[3] E. Gilbert. An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set , 1966 .

[4] G. Golub,et al. Linear least squares and quadratic programming , 1969 .

[5] R. Barr. An Efficient Computational Procedure for a Generalized Quadratic Programming Problem , 1969 .

[6] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .

[7] P. Wolfe. Algorithm for a least-distance programming problem , 1974 .

[8] V. N. Malozemov,et al. Finding the Point of a Polyhedron Closest to the Origin , 1974 .

[9] Balder Von Hohenbalken,et al. A finite algorithm to maximize certain pseudoconcave functions on polytopes , 1975, Math. Program..