Skip to main content
Log in

Minimizing method for functions that satisfy the Lipschitz condition

  • Published:
Cybernetics Aims and scope

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.

Literature Cited

  1. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  2. F. H. Clark, “Generalized gradients and applications,” Trans. Am. Math. Soc.,205, 247–262 (1975).

    Google Scholar 

  3. A. M. Gupal, Stochastic Methods of Solving Rough Extremal Problems [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  4. E. A. Nurminskii, “Convergence conditions for nonlinear-programming algorithms,” Kibernetika, No. 3, 79–81 (1973).

    Google Scholar 

  5. A. M. Gupal, “A method of minimizing almost-differentiable functions,” Kibernetika, No. 1, 114–116 (1977).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 5, pp. 91–94, September–October, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupal, A.M. Minimizing method for functions that satisfy the Lipschitz condition. Cybern Syst Anal 16, 733–737 (1980). https://doi.org/10.1007/BF01078505

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation