This is a preview of subscription content, log in via an institution to check access.
References
Ph. Gill, W. Murray, and M. Wright, Practical Optimization, Academic Press, New York (1981).
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).
V. V. Voevodin and Yu. A. Kuznetsov, Matrices and Computations [in Russian], Nauka, Moscow (1984).
M. B. Shchepakin, “Construction of a linear manifold by the orthogonal descent method,” Kibernetika, No. 2, 113–114 (1989).
M. B. Shchepakin, “Inconsistency test for a system of convex sets for a class of Fejer approximations,” Kibernetika, No. 2, 124 (1985).
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).
M. B. Shchepakin, “On the orthogonal descent method,” Kibernetika, No. 1, 58–62 (1987).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 65–74, November–December, 1992.
Rights and permissions
About this article
Cite this article
Shchepakin, M.B. Orthogonal descent to a convex set in a linear manifold. Cybern Syst Anal 28, 861–867 (1992). https://doi.org/10.1007/BF01291289
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01291289