Skip to main content
Log in

Monotoneε-subgradient method for finding saddle points of convex—concave functions

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

References

  1. V. Z. Belen'kii and V. A. Volkonskii (eds.),Iterative Methods in Game Theory and Programming [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  2. V. L. Makarov and A. M. Rubinov,Mathematical Theory of Economic Dynamics and Equilibrium [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  3. V. M. Polterovich, “Economic theory and the optimum,“Ékon. Mat. Metody,9, No. 5, 835–845 (1973).

    Google Scholar 

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

    Google Scholar 

  5. Yu. M. Danilin and V. M. Panin, “On some methods for finding saddle points,“Kibernetika, No. 3, 119–124 (1974).

    Google Scholar 

  6. E. G. Gol'shtein, “Generalized gradient method for finding saddle points,“Ékon. Mat. Metody,8, No. 4, 569–579 (1972).

    Google Scholar 

  7. D. B. Yudin and A. S. Nemirovskii, “Data complexity and effective methods for solution of convex extremal problems,“Ékon. Mat. Metody,12, No. 2, 357–369 (1976).

    Google Scholar 

  8. N. Z. Shor, “Cutoff method with space dilatation for solution of problems of convex programming,“Kibernetika, No. 1, 94–95 (1977).

    Google Scholar 

  9. W. Sangville,Nonlinear Programming. A Unified Approach [Russian translation], Sovetskoe Radio, Moscow (1973).

    Google Scholar 

  10. R. Rockefeller,Convex Analysis [Russian translation], Mir, Moscow (1973).

    Google Scholar 

  11. S. V. Rzhevskii, “On a principal algorithm for minimization of convex functions,“Kibernetika, No. 6, 13–14 (1979).

    Google Scholar 

  12. S. V. Rzhevskii, “ε-subgradient method for solution of convex-programming problems,“Zh. Vychisl. Mat. Mat. Fiz.,21, No. 5, 1126–1132 (1981).

    Google Scholar 

  13. S. V. Rzhevskii, “On a unified approach to the solution of problems of unconditional minimization,“Zh. Vychisl. Mat. Mat. Fiz.,20, No. 4, 857–863 (1980).

    Google Scholar 

  14. S. V. Rzhevskii, “Closed mappings in problems of unconditional minimization of convex functions,“Kibernetika, No. 5, 105–112 (1980).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 89–100, July–August, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rzhevskii, S.V. Monotoneε-subgradient method for finding saddle points of convex—concave functions. Cybern Syst Anal 29, 546–555 (1993). https://doi.org/10.1007/BF01125869

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation