Abstract:
Consideration is given to methods of Chebyshev points in convex programming and their applications in optimal control. These methods belong to a class of cutting-immersion methods whose idea is in the approximation of convex sets by concave polyhedra.
PACS:02.30.Yy
Presented by the member of Editorial Board:V. N. Bukov