Skip to main content
Log in

On conditions for the convergence of algorithms in optimal control problems

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Yu. M. Ermol'ev,Methods of Stochastic Programming [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  2. E. A. Nurminskii,Numerical Methods for Solution of Deterministic and Stochastic Minimax Problems [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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).

    Google Scholar 

Download references

Authors

Additional information

Translated fromObchyslyuval'na ta Prykladna Matematyka, No. 81 1997, pp. 70–71.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02680234

Keywords

Navigation