Skip to main content
Log in

Subgradient relaxation method for minimization of strictly convex functions

  • 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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature cited

  1. I. Ya. Zabotin, The Method of Generalized Supporting Hyperplanes for the Solution of Mathematical Programming Problems [in Russian], Kazan' (1982), pp. 19–28. Unpublished manuscript submitted by Kazan' University to VINITI, 25 Aug. 1983, No. 4633-83.

  2. I. Ya. Zabotin, “On choosing directions of descent in unconstrained minimization problems,” Issled. Prikl. Mat., Kazan', No. 9, 37–42 (1981).

    Google Scholar 

  3. F. P. Vasil'ev, Numerical Methods of Solution of Extremal Problems [in Russian], Nauka, Moscow (1980).

    Google Scholar 

Download references

Authors

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, Kazan', No. 14, pp. 34–42, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zabotin, I.Y., Kreinin, M.I. Subgradient relaxation method for minimization of strictly convex functions. J Math Sci 50, 1815–1819 (1990). https://doi.org/10.1007/BF01097202

Download citation

  • Issue Date:

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

Keywords

Navigation