Skip to main content
SpringerLink
Log in

Combined subgradient monotone methods for minimization of nonsmooth functions

  • Published:
Cybernetics Aims and scope

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. O. V. Glushkova, “On one method of nondifferentiable optimization,” Kibernetika, No. 5, 148–150 (1978).

    Google Scholar 

  2. N. D. Chepurnoi, “On one relaxation algorithm for minimization of nonsmooth functions,” Kibernetika, No. 2, 110–111 (1984).

    Google Scholar 

  3. N. D. Chepurnoi, “Seeking stationary points of convex-valued upper semicontinuous one-to-many mappings,” Eighth All-Union Symp. on Software Systems for Solution of Optimal Planning Problems, Abstracts of Papers [in Russian], TsÉMI, Moscow (1984), pp. 50–51.

    Google Scholar 

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

    Google Scholar 

  5. N. D. Chepurnoi, “A method of average quasigradients with stepwise step control for minimization of weakly convex functions,” Kibernetika, No. 6, 131–132 (1981).

    Google Scholar 

Download references

Authors
  1. N. D. Chepurnoi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 59–63, May–June, 1988.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chepurnoi, N.D. Combined subgradient monotone methods for minimization of nonsmooth functions. Cybern Syst Anal 24, 343–348 (1988). https://doi.org/10.1007/BF01132087

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation