This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. F. Dem'yanov, “On the solution of certain minimax problems I, II,” Kibernetika, No. 6 (1966); No. 3 (1967).
V. F. Demyanov, “Algorithms for some minimax problems,” Journal of Computer System Sciences, Nos. 2, 4, 342–380 (1968).
V. F. Dem'yanov, “On finding a minimax on a bounded set,” Dokl. Akad. Nauk SSSR,191, No. 6, 1216–1219 (1970).
V. F. Dem'yanov, “Finding saddle points on polyhedra,” Dokl. Akad. Nauk SSSR,192, No. 1 (1970).
S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, “On the concave n-person game and a certain production model,” Dokl. Akad. Nauk SSSR,191, No. 6, 1220–1222 (1970).
S. I. Zukhovitskii, R. A. Polyak and M. E. Primak, Numerical methods for the determination of equilibrium points of concave n-person games, Proc. of the First Winter School on Mathematical Programming, No. 1, Moscow (1969), 93–128.
V. F. Dem'yanov and A. B. Pevnyi, “Some estimates in minimax problems,” Kibernetika, No. 1 (1972).
Additional information
Translated from Kibernetika, No. 4, pp. 95–98, July–August, 1972.
Rights and permissions
About this article
Cite this article
Pevnyi, A.B. The convergence speed of some methods of finding minimaxes and saddle points. Cybern Syst Anal 8, 635–640 (1972). https://doi.org/10.1007/BF01068285
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068285