Skip to main content
SpringerLink
Log in

Gradient Methods for Nonstationary Unconstrained Optimization Problems

  • Determinate Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Problems of unconstrained optimization with an objective function depending on a scalar parameter (time) are considered. The solution of these problems also depends on time and any numerical method must keep track of this dependence. For the solution of such nonstationary problems, a discrete gradient method is treated, in which only one gradient step is taken for the varying function at each instant of time. Estimates of intervals (variations) between exact and approximate solutions are found and an asymptotic behavior of these estimates is defined.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Polyak, B.T., Vvedenie v optimizatsiyu (Introduction to Optimization), Moscow: Nauka, 1983.

    Google Scholar 

  2. Izmailov, A.F. and Solodov, M.V., Chislennye metody optimizatsii (Numerical Optimization Methods), Moscow: Fizmatlit, 2003.

    Google Scholar 

  3. Bakushinskii, A.B. and Polyak, B.T., On the Solution of Variational Inequalities, Dokl. Akad. Nauk SSSR, 1974, vol. 219, no.5, pp. 1038–1041.

    Google Scholar 

  4. Bakushinskii, A.B. and Goncharskii, A.V., Iterativnye metody resheniya nekorrektnykh zadach (Iteration Methods for the Solution of Ill-Conditioned Problems), Moscow: Nauka, 1988.

    Google Scholar 

  5. Nesterov, Y., Introductory Lectures on Convex Optimization. A Basic Course, Boston: Kluwer, 2004.

    Google Scholar 

  6. Nesterov, Y. and Nemirovskii, A., Interior-Point Polynomial Algorithms in Convex Programming, Philadelphia: SIAM, 1994.

    Google Scholar 

  7. Eremin, I.I. and Mazurov, V.D., Nestatsionarnye protsessy matematicheskogo programmirovaniya (Non-stationary Processes of Mathematical Programming), Moscow: Nauka, 1979.

    Google Scholar 

  8. Rastrigin, L.A., Sistemy ekstremal’nogo upravleniya (Systems of Optimizing Control), Moscow: Nauka, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Systems Analysis, Russian Academy of Sciences, Moscow, Russia

    A. Yu. Popkov

Authors
  1. A. Yu. Popkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

__________

Translated from Avtomatika i Telemekhanika, No. 6, 2005, pp. 38–46.

Original Russian Text Copyright © 2005 by Popkov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Popkov, A.Y. Gradient Methods for Nonstationary Unconstrained Optimization Problems. Autom Remote Control 66, 883–891 (2005). https://doi.org/10.1007/s10513-005-0132-z

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10513-005-0132-z

Keywords

Search

Navigation