Skip to main content
Log in

Relaxation methods of minimization of pseudoconvex 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. V. G. Karmanov, “Convergence estimates of iterative minimization methods,” Zh. Vychisl. Mat. Mat. Fiz.,14, No. 1, 3–14 (1974).

    Google Scholar 

  2. V. G. Karmanov, “An approach to investigating the convergence of relaxation processes of minimization,” Zh. Vychisl. Mat. Mat. Fiz.,14, No. 6, 1581–1585 (1974).

    Google Scholar 

  3. V. G. Karmanov, Mathematical Programming [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  4. Ya. I. Zabotin and A. I. Korabalev, “Pseudoconvex functionals and their extremal properties,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 4 (143), 27–31 (1974).

    Google Scholar 

  5. B. T. Polyak, “Existence and convergence theorems of minimizing sequences in extremum problems with constraints,” Dokl. Akad. Nauk SSSR,166, No. 2, 287–290 (1966).

    Google Scholar 

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

    Google Scholar 

  7. A. B. Pevnyi, “The convergence rate of some minimax and saddle point seeking methods,” Kibernetika, No. 4, 95–98 (1972).

    Google Scholar 

Download references

Authors

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 8, pp. 3–8, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korablev, A.I. Relaxation methods of minimization of pseudoconvex functions. J Math Sci 44, 1–5 (1989). https://doi.org/10.1007/BF01097545

Download citation

  • Issue Date:

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

Keywords

Navigation