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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bulatov, V.P., Approximation Methods in Solving Some Extremal Problems, Doctoral (Phys.-Math.) Dissertation, Tomsk: Tomsk. Univ., 1967.
Bulatov, V.P., Metody pogruzheniya v zadachakh optimizatsii (Imbedding Methods in Optimization Problems), Novosibirsk: Nauka, 1977.
Zukhovitskii, S.I., Polyak, R.A., and Primak, M.E., Two Methods for Jointing Equilibrium Points in Concave Games of n Persons, Dokl. Akad. Nauk, 1969, vol. 185, no. 1, pp. 24–27.
Nenakhov, E.I. and Primak, M.E., Convergence of the Method of Chebyshev Centers and Its Applications, Kibern., 1986, no. 2, pp. 60–65.
Primak, M.E., Convergence of the Modified Method of Chebyshev Centers for Solving Problems of Concave Programming, Kibern., 1977, no. 5, pp. 100–102.
Primak, M.E., Convergence of the Cutting Method with Cleaning at Every Step, Kibern., 1980, no. 1, pp. 119–121.
Elzinda, J. and Moore, T.G., A Central Cutting Plane Algorithm for the Convex Programming Problems, Math. Program., 1975, vol. 8, pp. 134–145.
Author information
Authors and Affiliations
Additional information
Original Russian Text © T.I. Belykh, V.P. Bulatov, E.N. Yas’kova, 2008, published in Avtomatika i Telemekhanika, 2008, No. 4, pp. 168–175.
This work is supported by the Russian Foundation for Basic Research, project no. 06-01-00465.
Rights and permissions
About this article
Cite this article
Belykh, T.I., Bulatov, V.P. & Yas’kova, E.N. Methods of Chebyshev points of convex sets and their applications. Autom Remote Control 69, 700–707 (2008). https://doi.org/10.1134/S0005117908040164
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117908040164