Advertisement

Mathematical Programming

, Volume 11, Issue 1, pp 128–149 | Cite as

Finding the nearest point in A polytope

  • Philip Wolfe
Article

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.

Keywords

Hull Mathematical Method Programming Problem Convex Hull Euclidean Norm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R.O. Barr, “An efficient computational procedure for a generalized quadratic programming problem”,SIAM Journal on Control 7 (1969) 415–429.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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).Google Scholar
  4. [4]
    G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J. 1963).Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    B. von Hohenbalken, “A finite algorithm to maximize certain pseudoconcave functions on polytopes”,Mathematical Programming 9 (1975) 189–206.Google Scholar
  8. [8]
    O.L. Mangasarian, “Linear and nonlinear separation of patterns by linear programming”,Operations Research 13 (1965) 444–452.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970).Google Scholar
  11. [11]
    D.R. Wilhelmsen, A linear algorithm for generating positive weight cubatures,Mathematics of Computation 30 (1976) to appear.Google Scholar
  12. [12]
    C. Witzgall, correspondence with P. Wolfe (December, 1974).Google Scholar
  13. [13]
    P. Wolfe, “Convergence theory in nonlinear programming”, in: J. Abadie, ed.,Integer and nonlinear programming, (North-Holland, Amsterdam, 1970) pp. 1–36.Google Scholar
  14. [14]
    P. Wolfe, “Algorithm for a least-distance programming problem”,Mathematical Programming Study 1 (1974) 190–205.Google Scholar

Copyright information

© The Mathematical Programming Society 1976

Authors and Affiliations

  • Philip Wolfe
    • 1
  1. 1.IBM Thomas J. Watson Research CenterNew YorkUSA

Personalised recommendations