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

Rate of convergence bound of Tikhonov's regularization method for the linear programming problem

  • 17 Accesses

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

Literature Cited

  1. 1.

    A. N. Tikhonov, “On ill-posed problems of optimal planning and stable methods of their solution,” Dokl. Akad. Nauk SSSR,164, No. 3, 507–510 (1965).

  2. 2.

    A. N. Tikhonov, “On ill-posed problems of optimal planning,” Zh. Vychisl. Mat. Mat. Fiz.,6, No. 1, 81–89 (1966).

  3. 3.

    A. N. Tikhonov and V. Ya. Arsenin, Methods of Solution of Ill-Posed Problems [in Russian], Nauka, Moscow (1979).

  4. 4.

    F. P. Vasil'ev, Methods of Solution of Extremal Problems [in Russian], Nauka, Moscow (1981).

  5. 5.

    F. P. Vasil'ev, Numerical Methods of Solution of Extremal Problems [in Russian], Nauka, Moscow (1980).

Download references

Additional information

Translated from Matematicheskie Modeli i Vychislitel'nye Metody, pp. 21–27, 1987.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Vasil'ev, F.P., Potapov, M.M. & Chekanov, Y.N. Rate of convergence bound of Tikhonov's regularization method for the linear programming problem. Comput Math Model 1, 283–287 (1990). https://doi.org/10.1007/BF01126580

Download citation

Keywords

  • Mathematical Modeling
  • Computational Mathematic
  • Programming Problem
  • Industrial Mathematic
  • Linear Programming Problem