Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
FINDING THE POINT OF A POLYHEDRON CLOSEST TO THE ORIGIN. / Mitchell, B. F.; Dem'yanov, V. F.; Malozemov, V. N.
в: SIAM J Control, Том 12, № 1, 1974, стр. 19-26.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
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