Skip to main content
SpringerLink
Log in

Problem of optimality of iteration processes

  • 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

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. I. I. Eremin, “Fejer approximation methods in convex programming,” Mat. Zametki,3, No. 3 (1968).

  2. R. F. Khabibullin, “On a method for finding points of a convex set,” in: Studies in Applied Mathematics [in Russian], Vol. 4, Kazan State Univ. (1977).

  3. R. F. Khabibullin, “A method of generalized descent for solving problems of minimizing functionals,” in: Studies in Applied Mathematics [in Russian], Vol. 4, Kazan State Univ. (1977).

Download references

Authors
  1. S. N. Perfilov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. F. Khabibullin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematika, No. 7, pp. 41–50, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perfilov, S.N., Khabibullin, R.F. Problem of optimality of iteration processes. J Math Sci 43, 2445–2451 (1988). https://doi.org/10.1007/BF01095649

Download citation

  • Issue Date:

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

Keywords

Search

Navigation