Abstract
We obtain sufficient conditions for the convergence of iteration algorithms in Banach spaces. These conditions imply the weak convergence of subsequences to the set of solutions. Bibliography: 4 titles.
Similar content being viewed by others
References
Yu. M. Ermol'ev,Methods of Stochastic Programming [in Russian], Nauka, Moscow (1976).
E. A. Nurminskii,Numerical Methods for Solution of Deterministic and Stochastic Minimax Problems [in Russian], Naukova Dumka, Kiev (1979).
S. I. Lyashko, “Method of possible directions in solving extremal problems for functions with unknown parameters,” in:Mathematical Methods in Study of Operations and Reliability Theory [in Russian], Institute of Cybernetics, Academy of Science of USSR, Kiev (1978), pp. 20–24.
W. I. Zangwill,Convergence Condition for Nonlinear Programming Algorithms, Working Paper No. 197, Center for Research in Management Science, University of California, Berkeley, Calif. (1966).
Additional information
Translated fromObchyslyuval'na ta Prykladna Matematyka, No. 81 1997, pp. 70–71.
Rights and permissions
About this article
Cite this article
Lyashko, S.I. On conditions for the convergence of algorithms in optimal control problems. J Math Sci 102, 3782–3783 (2000). https://doi.org/10.1007/BF02680234
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02680234