Skip to main content
SpringerLink
Log in

Cut-off method with space extension in convex programming problems

  • 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, “The use of the operation of space dilatation in the minimization of convex functions,” Kibernetika, No. 1 (1970).

  2. N. Z. Shor, “Generalized gradient methods for the minimization of nonsmooth functions and their application in mathematical programming (survey),” Ékonom. Mat. Metody,12, No. 2 (1976).

  3. D. B. Yudin and A. S. Nemirovskii, “Informational complexity and effective methods for the solution of convex extremal problems,” Ékonom. Mat. Metody,12, No. 2 (1976).

    Google Scholar 

  4. A. Yu. Levin, “An algorithm for the minimization of convex functions,” Dokl. Akad. Nauk SSSR,160, No. 6 (1965).

Download references

Authors
  1. N. Z. Shor
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 94–95, January–February, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shor, N.Z. Cut-off method with space extension in convex programming problems. Cybern Syst Anal 13, 94–96 (1977). https://doi.org/10.1007/BF01071394

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation