Skip to main content
SpringerLink
Log in

Finding the nearest point in A polytope

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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. 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.

  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. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J. 1963).

    Google Scholar 

  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. 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. B. von Hohenbalken, “A finite algorithm to maximize certain pseudoconcave functions on polytopes”,Mathematical Programming 9 (1975) 189–206.

    Google Scholar 

  8. O.L. Mangasarian, “Linear and nonlinear separation of patterns by linear programming”,Operations Research 13 (1965) 444–452.

    Google Scholar 

  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. J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970).

    Google Scholar 

  11. D.R. Wilhelmsen, A linear algorithm for generating positive weight cubatures,Mathematics of Computation 30 (1976) to appear.

  12. C. Witzgall, correspondence with P. Wolfe (December, 1974).

  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. P. Wolfe, “Algorithm for a least-distance programming problem”,Mathematical Programming Study 1 (1974) 190–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, New York, USA

    Philip Wolfe

Authors
  1. Philip Wolfe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580381

Keywords

Search

Navigation