Standard

FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN. / Mitchell, B. F.; Dem'yanov, V. F.; Malozemov, V. N.

In: SIAM J Control, Vol. 12, No. 1, 1974, p. 19-26.

Research output: Contribution to journal › Article › peer-review

Harvard

Mitchell, BF, Dem'yanov, VF & Malozemov, VN 1974, 'FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN.', SIAM J Control, vol. 12, no. 1, pp. 19-26. https://doi.org/10.1137/0312003

APA

Mitchell, B. F., Dem'yanov, V. F., & Malozemov, V. N. (1974). FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN. SIAM J Control, 12(1), 19-26. https://doi.org/10.1137/0312003

Vancouver

Mitchell BF, Dem'yanov VF, Malozemov VN. FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN. SIAM J Control. 1974;12(1):19-26. https://doi.org/10.1137/0312003

Author

Mitchell, B. F. ; Dem'yanov, V. F. ; Malozemov, V. N. / FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN. In: SIAM J Control. 1974 ; Vol. 12, No. 1. pp. 19-26.

BibTeX

@article{870056ebc65b4c8ca8aa9f9d8ee448ea,
title = "FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN.",
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.",
author = "Mitchell, {B. F.} and Dem'yanov, {V. F.} and Malozemov, {V. N.}",
note = "Copyright: Copyright 2018 Elsevier B.V., All rights reserved.",
year = "1974",
doi = "10.1137/0312003",
language = "English",
volume = "12",
pages = "19--26",
journal = "SIAM Journal on Control and Optimization",
issn = "0363-0129",
publisher = "Society for Industrial and Applied Mathematics",
number = "1",

}

RIS

TY - JOUR

T1 - FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN.

AU - Mitchell, B. F.

AU - Dem'yanov, V. F.

AU - Malozemov, V. N.

N1 - Copyright: Copyright 2018 Elsevier B.V., All rights reserved.

PY - 1974

Y1 - 1974

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

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

UR - http://www.scopus.com/inward/record.url?scp=0016025580&partnerID=8YFLogxK

U2 - 10.1137/0312003

DO - 10.1137/0312003

M3 - Article

AN - SCOPUS:0016025580

VL - 12

SP - 19

EP - 26

JO - SIAM Journal on Control and Optimization

JF - SIAM Journal on Control and Optimization

SN - 0363-0129

IS - 1

ER -

ID: 73932577