Skip to main content
SpringerLink
Log in

Method of control sequences for the solution of equilibrium problems. I

  • Published:
Cybernetics 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

Literature Cited

  1. R. A. Polyak, “On the acceleration of convergence of convex programming methods,” Dokl. Akad. Nauk SSSR,212, No. 5 (1973).

    Google Scholar 

  2. L. A. Kirievskii and R. A. Polyak, “On the acceleration of convergence of convex programming methods,” Dokl. Akad. Nauk SSSR,209, No. 5 (1973).

    Google Scholar 

  3. M. E. Primak, “On a general optimal-equilibrium problem and certain econometric models,” Dokl. Akad. Nauk SSSR,200, No. 3 (1971).

    Google Scholar 

  4. J. B. Rozen, “Existence and uniqueness of equilibrium points for concave n-person games,” Econometrica,33, No. 5 (1965).

    Google Scholar 

  5. M. E. Primak, “On a general extremal-equilibrium problem in econometrics,” in: Transactions of the Fourth School on Mathematical Programming [in Russian], No. 2, Moscow, (1972).

  6. M. M. Vainberg, “On the convergence of the process of steepest descent for nonlinear equations,” Sibirsk. Mat. Zh.,2, No. 2 (1961).

    Google Scholar 

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

  8. I. M. Glazman, “Relaxation methods,” in: Transactions of the First School on Mathematical Programming [in Russian], No. 1, Moscow (1969).

  9. Yu. I. Lyubich and G. D. Maistrovskii, “A general theory of relaxation processes for convex functionals,” Usp. Mat. Nauk,25, No. 1 (151) (1970).

  10. G. D. Maistrovskii, “Proof of quadratic convergence of the method of conjugate gradients,” Vychisl. Mat. Vychisl. Tekh., No. 2 (1971).

  11. R. Fletcher and C. Ruves, “Function minimization by conjugate gradients,” Comput. J.,7, No. 2 (1964).

    Google Scholar 

  12. H. Y. Huang, “United approach to quadratically convergent algorithms for function minimization,” J. Optimiz. Theory Appl.,5 No. 6 (1970).

    Google Scholar 

  13. Yu. M. Danilin, “The method of conjugate directions for the solution of minimization problems,” Kibernetika, No. 5 (1971).

  14. Yu. M. Danilin and B. N. Pshenichnyi, “Estimating rate of convergence of a class of minimization algorithms,” Dokl. Akad. Nauk SSSR,213, No. 2 (1973).

    Google Scholar 

  15. J. B. Dennis, Mathematical Programming and Electrical Networks, Wiley, New York (1957).

    Google Scholar 

  16. J. B. Rozen, “The gradient projection method for nonlinear programming. I,” SIAM J.,8, No. 1 (1960).

    Google Scholar 

  17. V. F. Dem'yanov, “Finding saddle points on polyhedra,” Dokl. Akad. Nauk SSSR,192, No. 1 (1970).

  18. A. B. Pevnyi, “Certain iterative processes for the solution of convex games,” Vestn. Mosk. Gos. Univ., No. 13 (1973).

  19. B. N. Pshenichnyi and I. F. Ganzhela, “Algorthm for the solution of convex programming problems with linear constraints,” Kibernetika, No. 3 (1970).

  20. A. A. Goldstein, “Convex programming in Hilbert space,” Bull. Amer. Math. Soc.,70, No. 5 (1964).

    Google Scholar 

  21. E. S. Levitin and B. T. Polyak, “Methods of minimization in the presence of constraints,” Zh. Vychisl. Mat. Mat. Fiz.,6, No. 5 (1966).

    Google Scholar 

  22. A. B. Bakushinskii and B. T. Polyak, “On the solution of variational inequalities,” Dokl. Akad. Nauk SSSR,219, No. 5 (1974).

    Google Scholar 

  23. A. Auslender, “Recherche des points de selle d'une fonction,” Cah. Cent. Etud. Rech. Oper.,12, No. 2 (1970).

  24. M. E. Primak, “On a computational process for finding equilibrium points,” Kibernetika, No. 1 (1973).

  25. M. Frank and P. Wolfe, “Algorithm for quadratic programming,” Nav. Res. Log. Quart.,3, Nos. 1, 2 (1956).

  26. V. F. Dem'yanov and A. M. Rubinov, “Minimization of a smooth convex functional on a convex set,” Vestn. Leningr. Gos. Univ.,19 (1964).

  27. V. A. Volkonskii, “Optimal planning in the presence of high dimensionality,” Ékonom. Mat. Metody,1, No. 2 (1965).

  28. V. S. Mikhalevich, Yu. M. Ermol'ev, V. V. Shkurba, and N. Z. Shor, “Complex systems and the solution of extremal problems,” Kibernetika, No. 5 (1967).

  29. V. A. Volkonskii and S. A. Ivankov, “The convergence of iterative processes for finding equilibrium points,” Sibirsk. Mat. Zh.,11, No. 4 (1970).

    Google Scholar 

  30. Yu. B. Germeier, “On the problem of finding a minimax with constraints,” Zh. Vychisl. Mat. Mat. Fiz.,10, No. 10 (1970);11, No. 1 (1971).

  31. J. Nash, “Non-cooperative games,” Ann. Math.,54 (1951).

  32. É. Polak, Computational Methods in Optimization. A Unified Approach, Academic Press, New York (1971).

    Google Scholar 

Download references

Authors
  1. R. A. Polyak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. E. Primak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 92–101, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Polyak, R.A., Primak, M.E. Method of control sequences for the solution of equilibrium problems. I. Cybern Syst Anal 13, 241–252 (1977). https://doi.org/10.1007/BF01073318

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation