Skip to main content
SpringerLink
Log in

Maxmin subject to marginal constraints

  • 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

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

References

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

    Google Scholar 

  2. V. V. Fedorov, Numerical Maxmin Methods [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  3. E. A. Nurminskii, Numerical Methods for Solving Deterministic and Stochastic Minmax Problems [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  4. Yu. M. Ermol'ev and A. A. Gaivoronskii, “A stochastic method for solving minmax problems,” Kibernetika, No. 4, 92–97 (1983).

    MathSciNet  Google Scholar 

  5. A. A. Gaivoronskii, “Numerical methods for minimization of convex functionals of probability measures with application to optimal monitoring,” Kibernetika, No. 4, 43–51 (1989).

    MathSciNet  Google Scholar 

  6. S. V. Shibaev, “A method of finding the minmax of functionals dependent on probability measures,” Kibern. Sistem. Anal., No. 2, 79–85 (1992).

    MATH  MathSciNet  Google Scholar 

  7. V. V. Fedorov, Optimal Experiment Theory [in Russian], Nauka, Moscow (1971).

    Google Scholar 

  8. H. Moulin, Game Theory for the Social Sciences, NYU Press, New York (1982).

    Google Scholar 

  9. S. V. Shibaev, Analysis of Substantive Scenarios of Player Behavior Under Incomplete Information [in Russian], abstract of thesis, Inst. Kibern. Akad. Nauk Ukr., Kiev (1988).

    Google Scholar 

  10. S. V. Shibaev, “Stochastic maxmin algorithm,” in: Mathematical Methods of Analysis of Complex Stochastic Systems, Inst. Kibern. Akad. Nauk Ukr., Kiev (1988), pp. 12–17.

    Google Scholar 

  11. Yu. M. Ermol'ev, Stochastic Programming Methods [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  12. E. G. Gol'shtein and N. V. Tret'yakov, “Weakly augmented Lagrange functions and associated duality theorems,” Ekon. Mat. Metody,15, No. 6, 1180–1193 (1979).

    MathSciNet  Google Scholar 

  13. R. T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,” Math. Oper. Res., No. 1, 97–116 (1980).

    MathSciNet  Google Scholar 

  14. H. Uzawa, “Iterative methods in convex programming,” in: Studies in Linear and Nonlinear Programming [Russian translations], IL, Moscow (1962).

    Google Scholar 

  15. W. I. Zangwill, Nonlinear Programming: A Unified Approach, Prentice Hall, Englewood Cliffs, N.J. (1969).

    Google Scholar 

  16. Yu. M. Ermol'ev “Methods for solving nonlinear extremal problems,” Kibernetika, No. 4, 1–17 (1966).

    MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  18. E. A. Nurminskii and P. I. Verchenko, “Convergence of saddle-point algorithms,” Kibernetika, No. 3, 112–116 (1977).

    Google Scholar 

  19. G. D. Maistrovskii, “On gradient saddle-point methods,” Ekon. Mat. Metody,12, No. 5, 917–929 (1976).

    MATH  MathSciNet  Google Scholar 

  20. V. F. Dem'yanov, “Subgradient method and saddle points,” Vestnik LGU, No. 7, 17–23 (1981).

    MATH  MathSciNet  Google Scholar 

  21. A. S. Nemirovskii and D. B. Yudin, “Cesare convergence of the gradient method for approximation of saddle points of convex — concave functions,” Dokl. Akad. Nauk SSSR,239, No. 5, 1056–1059 (1978).

    MathSciNet  Google Scholar 

  22. Yu. M. Ermol'ev and E. A. Nurminskii, “Limit extremal problems,” Kibernetika, No. 4, 130–132 (1973).

    MathSciNet  Google Scholar 

  23. A. M. Gupal and A. N. Golodnikov, “Some methods of solving limit extremal problems,” in: Methods of Operations Research and Reliability Theory in System Analysis [in Russian], (1976), pp. 64–74.

  24. E. A. Nurminskii and A. A. Gaivoronskii, “Nonstationary extremal problem,” in: Methods of Operations Research and Reliability Theory in System Analysis [in Russian], (1976), pp. 84–97.

  25. F. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York (1983).

    Google Scholar 

  26. K. Parthasarathy, An Introduction to Probability Theory and Measure Theory [Russian translation], Mir, Moscow (1983).

    Google Scholar 

  27. B. N. Pshenichnyi, Necessary Conditions of Extremum [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  28. S. P. Uryas'ev, “Step control for direct stochastic programming methods,” Kibernetika, No. 6, 96–98 (1979).

    Google Scholar 

  29. S. V. Shibaev, “A stochastic method for solving constrained minmax problems,” in: Mathematical Methods of Analysis and Optimization of Complex Systems Operating Under Uncertainty [in Russian], Inst. Kibern. Akad. Nauk Ukr, Kiev (1989), pp. 10–17.

    Google Scholar 

Download references

Authors
  1. S. V. Shibaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 103–114, November–December, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shibaev, S.V. Maxmin subject to marginal constraints. Cybern Syst Anal 30, 875–884 (1994). https://doi.org/10.1007/BF02366446

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation