Skip to main content
Log in

Heavy-ball method in nonconvex optimization problems

  • Models of Ecologic and Economic Systems
  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

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.

Institutional subscriptions

Literature Cited

  1. B. T. Polyak, Introduction to Optimization [in Russian], Nauka, Moscow (1983).

    Google Scholar 

  2. Yu. E. Nesterov, "A method of solving the convex programming problem withO(1/k 2) convergence," Dokl. Akad. Nauk SSSR,269, No. 3, 543–547 (1983).

    Google Scholar 

  3. A. S. Nemirovskii and D. B. Yudin, Complexity of Optimization Problems and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  4. A. S. Antipin, "Continuous and iterative processes with projection and projection-like operators," Vopr. Kibern., No. 1, 5–43 (1989).

    Google Scholar 

  5. P. A. Dorofeev, Generalized Heavy Ball Methods [in Russian], Unpublished manuscript, VINITI No. 5779–85 (1985).

  6. A. S. Antipin, Nonlinear Programming Methods Based on Primal and Dual Modification of Lagrange Function [in Russian], Izd. VNIISI, Moscow (1979).

    Google Scholar 

  7. S. K. Zavriev, Stochastic Gradient Methods for Minmax Problems [in Russian], Moscow Univ. (1984).

Download references

Authors

Additional information

Translated from Programmnoe Obespechenie i Modeli Sistemnogo Analiza, pp. 179–185, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zavriev, S.K., Kostyuk, F.V. Heavy-ball method in nonconvex optimization problems. Comput Math Model 4, 336–341 (1993). https://doi.org/10.1007/BF01128757

Download citation

  • Issue Date:

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

Keywords

Navigation