Skip to main content
Log in

Subgradient method to find the saddle point of a convex-concave function

  • 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. V. F. Dem'yanov and L. V. Vasil'ev, Nondifferentiable Optimization [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  2. V. F. Dem'yanov and A. B. Pevnyi, “Numerical methods of finding saddle points,” Zh. Vychisl. Mat. Mat. Fiz.,12, No. 5, 1099–1127 (1972).

    Google Scholar 

  3. E. G. Gol'shtein, “Generalized gradient method to find saddle points,” Ékon. Mat. Metody,8, No. 4, 569–579 (1972).

    Google Scholar 

Download references

Authors

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 15, pp. 6–12, 1988.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zabotin, I.Y. Subgradient method to find the saddle point of a convex-concave function. J Math Sci 61, 2321–2325 (1992). https://doi.org/10.1007/BF01097339

Download citation

  • Issue Date:

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

Keywords

Navigation