This is a preview of subscription content, log in via an institution to check access.
References
B. T. Polyak, “Minimization of nonsmooth functionals,“Zh. Vychisl. Mat. Mat. Fiz.,9, No. 3, 507–521 (1969).
M. B. Shchepakin, “On the properties of overall displacement directions,“Kibernetika, No. 1, 135–136 (1978).
M. B. Shchepakin, “On an inconsistency criterion for a system of convex inequalities for one class of Fejer approximations,“Kibernetika, No. 2, 124 (1985).
M. B. Shchepakin, “On the orthogonal-descent method,“Kibernetika, No. 1, 58–62 (1987).
M. B. Shchepakin, “On the convergence rate of the orthogonal-descent method,“Kibernetika, No. 1, 113–115 (1989).
M. B. Shchepakin, “An orthogonal-descent algorithm for finding the zero of a convex function, determination of problem unsolvability, and questions of convergence rate,“Kibernetika, No. 5, 87–96 (1992).
I. A. Shubenkova and M. B. Shchepakin, “On a modified orthogonal-descent method,“ in:Theory of Optimal Solutions [in Russian], Inst. Cybernetics, Acad. Sci. Ukraine, Kiev (1992), pp. 49–53.
C. Lemarechal, “Numerical experiment in nonsmooth optimization,“ in:Progress in Nondifferentiable Optimization, E. A. Nurminski (ed), Laxenburg (1992), pp. 61–84.
Yu. E. Nesterov and E. I. Purmal’,Analysis of the Effectiveness of Nonsmooth-Optimization Methods [in Russian], CEMI Acad. Sci. USSR, Moscow (1984).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 63–72, July–August, 1993.
Rights and permissions
About this article
Cite this article
Shchepakin, M.B., Shubenkova, I.A. A modified orthogonal-descent algorithm for finding the zero of a complex function. Cybern Syst Anal 29, 522–530 (1993). https://doi.org/10.1007/BF01125866
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01125866