Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Optimization of relaxation processes

This is a preview of subscription content, log in to check access.

Literature cited

  1. 1.

    R. G. Strongin, Numerical Methods in Multiextremum Problems [in Russian], Nauka, Moscow (1978).

  2. 2.

    V. V. Ivanov, “On optimal algorithms for minimization of functions of some classes,” Kibernetika, No. 4, 81–94 (1972).

  3. 3.

    A. G. Sukharev, Optimal Extremum Seeking Procedures [in Russian], Moscow State Univ. (1975).

  4. 4.

    A. G. Sukharev, “Global extremum and extremum seeking methods,” in; Mathematical Methods of Operations Research [in Russian], Moscow State Univ. (1981), pp. 4–36.

  5. 5.

    B. A. Vertgeim, “Optimal alteration of the basic and the modified Newton-Kantorovich processes,” in: Optimal Planning [in Russian], No. 17, Novosibirsk (1970), pp. 10–31.

  6. 6.

    V. A. Sukhanov, “Optimal realization of the fastest descent method and the gradient projection method,” in: Optimization of Control of Complex Continuous Processes [in Russian], Tomsk State Univ. (1981), pp. 38–41.

  7. 7.

    S. N. Perfilov and R. F. Khabibullin, “On optimality of iterative processes,” Issled. Prikl. Mat., Kazan, No. 7 (1979).

  8. 8.

    S. N. Perfilov, “On efficiency of one class of iterative processes,” Issled. Prikl. Mat., Kazan, No. 9, 48–56 (1981).

Download references

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 12, pp. 35–46, 1984.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Perfilov, S.N., Khabibullin, R.F. Optimization of relaxation processes. J Math Sci 45, 1013–1019 (1989). https://doi.org/10.1007/BF01095694

Download citation

Keywords

  • Relaxation Process