This is a preview of subscription content, log in via an institution to check access.
References
M. B. Shchepakin, “Orthogonal descent to a convex set in a linear manifold,” Kibern. Sist. Analiz, No. 6, 65–74 (1992).
M. B. Shchepakin, “An orthogonal descent algorithm to find the zero of a convex function, establish unsolvability of a problem, and issues of rate of convergence,” Kibern. Sist. Analiz, No. 5, 87–96 (1992).
S. I. Zukhovitskii and L. I. Avdeeva, Linear and Convex Programming [in Russian], Nauka, Moscow (1987).
V. V. Podinovskii and V. M. Gavrilov, Optimization by Sequential Criteria [in Russian], Sovetskoe Radio, Moscow (1975).
V. V. Voevodin and Yu. A. Kuznetsov, Matrices and Computations [in Russian], Nauka, Moscow (1984).
I. I. Eremin, “On sequential programming problems,” Sib. Mat. Zh.,14, No. 1, 53–63 (1973).
G. M. Korpelevich, “Extragradient method to find saddle points and other problems,” Ékon. Mat. Metody,12, No. 4, 747–756 (1976).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 94–101, January–February, 1993.
Rights and permissions
About this article
Cite this article
Shchepakin, M.B. Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method. Cybern Syst Anal 29, 72–77 (1993). https://doi.org/10.1007/BF01130091
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01130091