FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN.

B. F. Mitchell, V. F. Dem'yanov, V. N. Malozemov

Research output: Contribution to journalArticlepeer-review

86 Scopus citations

Abstract

An algorithm is given for finding the point of a convex polyhedron in an n-dimensional Euclidean space which is closest to the origin. It is assumed that the convex polyhedron is defined as the convex hull of a given finite set of points. This problem arises when one wishes to determine the direction of steepest descent for certain minimax problems.

Original languageEnglish
Pages (from-to)19-26
Number of pages8
JournalSIAM J Control
Volume12
Issue number1
DOIs
StatePublished - 1974

Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN.'. Together they form a unique fingerprint.

Cite this