Skip to main content
SpringerLink
Log in

The gradient descent method applied to convex discrete 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. G. D. Birkhoff, Lattice Theory, Amer. Math. Soc., New York (1967).

    Google Scholar 

  2. M. F. Kaspshitskaya and I. V. Sergienko, “Formulation of effective methods for the solution of problems in the organization of a computation process,” Kibernetika, No. 4 (1969).

  3. M. F. Kaspshitskaya and I. V. Sergienko, “Organization of the solution of problems in a computer complex,” Kibernetika, No. 5 (1970).

  4. V. P. Cherenin, “Solution of certain combinatorial optimum planning problems by the method of successive calculations,” Conf. Practices and Prospects for the Application of Mathematical Methods and Electronic Computers in Planning [in Russian], Novosibirsk (1962).

Download references

Authors
  1. M. F. Kaspshitskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 107–108, November–December, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaspshitskaya, M.F., Sergienko, I.V. The gradient descent method applied to convex discrete functions. Cybern Syst Anal 7, 1065–1066 (1971). https://doi.org/10.1007/BF01068837

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation