Skip to main content
SpringerLink
Log in

Convergence of subgradient methods of minimizing convex functions

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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

Literature cited

  1. N. Z. Shor, “Generalized gradient methods of minimizing nonsmooth functions, and an application to mathematical programming problems. A survey,” Ekon. Mat. Metody,12, No. 2 (1976).

  2. R. T. Rockafellar, Convex Analysis, Princeton Univ. Press (1970).

  3. N. Z. Shor and L. P. Shabasheva, “The solution of minimax problems by the generalized gradient descent method with an expansion of space,” Kibernetika,1972, No. 1.

Download references

Authors
  1. M. I. Kreinin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 7, pp. 24–32, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kreinin, M.I. Convergence of subgradient methods of minimizing convex functions. J Math Sci 43, 2434–2439 (1988). https://doi.org/10.1007/BF01095647

Download citation

  • Issue Date:

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

Keywords

Search

Navigation