Skip to main content
SpringerLink
Log in

New development trends in nondifferentiable optimization

  • 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. N. Z. Shor, “Generalized gradient methods of nondifferentiable function minimization and their application to problems of mathematical programming (Survey),” Ekon. Mat. Metody, No. 2 (1976).

  2. M. L. Balinskii and P. Wolfe (editors), Mathematical Programming. Study 3, Nondifferentiable Optimization, North-Holland, Amsterdam (1975).

    Google Scholar 

  3. G. Zoutendijk, Methods of Feasible Directions, Elsevier (1960).

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

    Google Scholar 

  5. I. I. Eremin, “On the method of ‘penalties’ in convex programming,” Kibernetika, No. 4 (1967).

  6. D. P. Bertsekas, “Necessary and sufficient conditions for a penalty method to be exact,” Math. Program.,9, No. 1 (1975).

  7. L. I. Bazhenov, “On convergence conditions for methods of minimization of almost differentiable functions,” Kibernetika, No. 4 (1972).

  8. N. Z. Shor and N. G. Zhurbenko, “A minimization method utilizing the operation of space expansion in the direction of the difference of two successive gradients,” Kibernetika, No. 3 (1971).

  9. N. Z. Shor and L. P. Shabashova, “On the solution of minimax problems by the method of generalized gradient descent with space expansion,” Kibernetika, No. 1 (1972).

  10. I. G. Ovrutskii and N. Z. Shor, “Application of nondifferentiable function minimization methods for solving problems of interpretation of gravimetric observations,” Kibernetika, No. 2 (1976).

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

    Google Scholar 

  12. M. Held and R. M. Karp, “The traveling-salesman problem and minimum spanning trees. Part II,” Math. Program.,4, No. 2 (dy1973).

  13. M. Held, P. Wolfe, and H. P. Crowder, “Validation of subgradient optimization,” Math. Program.,6, No. 1 (dy1974).

  14. V. F. Dem'yanov and V. N. Malozemov, Introduction to the Minimax [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  15. C. Lemarechal, “An extension of Davidon methods to nondifferentiable problems,” Math. Program., Study 3 (1975).

  16. P. Wolfe, “A method of conjugate subgradients for minimizing nondifferentiable functions,” Math. Program., Study 3 (1975).

  17. G. E. Kelley, “The ‘cutting plane’ method for solving convex programs,” SIAM J.,8, No. 4 (dy1960).

  18. A. Yu. Levin, “On an algorithm for minimizing convex functions,” Dokl. Akad. Nauk SSSR,160, No. 6 (dy1965).

  19. D. B. Yudin and A. S. Nemirovskii, “Informational complexity and effective methods for solving convex extremal problems,” Ékon. Mat. Metody, No. 2 (1976).

  20. N. Z. Shor, “Cutting-plane methods with space expansion for solving problems of convex programming,” Kibernetika, No. 1 (1977).

Download references

Authors
  1. N. Z. Shor
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The present article is a continuation of the survey

Translated from Kibernetika, No. 6, pp. 87–91, November–December, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shor, N.Z. New development trends in nondifferentiable optimization. Cybern Syst Anal 13, 881–886 (1977). https://doi.org/10.1007/BF01068854

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation