Abstract
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.
Similar content being viewed by others
References
R.O. Barr, “An efficient computational procedure for a generalized quadratic programming problem”,SIAM Journal on Control 7 (1969) 415–429.
L.C. Barbosa and E. Wong, “On a class of iterative algorithms for linear inequalities with applications to pattern classification”, in:Proceedings of the first annual Princeton conference of information sciences and systems, 1967, pp. 86–89.
M.D. Canon and C.D. Cullum, “The determination of optimum separating hyperplanes I. A finite step procedure”, RC 2023, IBM Watson Research Center, Yorktown Heights, New York (February, 1968).
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J. 1963).
E.G. Gilbert, “An iterative procedure for computing the minimum of a quadratic form on a convex set”,SIAM Journal on Control 4 (1966) 61–80.
G.H. Golub and M.A. Saunders, Linear least squares and quadratic programming, in: J. Abadie, ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970) Ch. 10.
B. von Hohenbalken, “A finite algorithm to maximize certain pseudoconcave functions on polytopes”,Mathematical Programming 9 (1975) 189–206.
O.L. Mangasarian, “Linear and nonlinear separation of patterns by linear programming”,Operations Research 13 (1965) 444–452.
B.F. Mitchell, V.F. Demyanov, and V.N. Malozemov, “Finding the point of a polyhedron closest to the origin”,SIAM Journal on Control 12 (1974) 19–26.
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970).
D.R. Wilhelmsen, A linear algorithm for generating positive weight cubatures,Mathematics of Computation 30 (1976) to appear.
C. Witzgall, correspondence with P. Wolfe (December, 1974).
P. Wolfe, “Convergence theory in nonlinear programming”, in: J. Abadie, ed.,Integer and nonlinear programming, (North-Holland, Amsterdam, 1970) pp. 1–36.
P. Wolfe, “Algorithm for a least-distance programming problem”,Mathematical Programming Study 1 (1974) 190–205.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wolfe, P. Finding the nearest point in A polytope. Mathematical Programming 11, 128–149 (1976). https://doi.org/10.1007/BF01580381
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580381