Skip to main content
SpringerLink
Log in

Numerical solution of sample minimization problems by the ε-subgradient method

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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. A. I. Korablev and O. V. Mironov, “An algorithm of ε-subgradient minimization and its application,” Issled. Prikl. Mat., Kazan, No. 7, 12–18 (1979).

    Google Scholar 

  2. N. Z. Shor and L. P. Shabashova, “On solving minimax problems by the generalized gradient descent method with space stretching,” Kibernetika, No. 1, 82–88 (1972).

    Google Scholar 

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

    Google Scholar 

  4. É. I. Nenakhov, “On the method of conjugate subgradients for solving unconstrained optimization problems,” in: Optimal Decision Theory [in Russian], Kiev (1976), pp. 3–10.

Download references

Authors
  1. A. I. Korablev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. V. Mironov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 8, pp. 9–14, 1980.

In conclusion, we would like to acknowledge the technical assistance of M. K. Tukaev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korablev, A.I., Mironov, O.V. Numerical solution of sample minimization problems by the ε-subgradient method. J Math Sci 44, 5–9 (1989). https://doi.org/10.1007/BF01097546

Download citation

  • Issue Date:

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

Keywords

Search

Navigation