Skip to main content
Log in

Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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. G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam (1960).

    Google Scholar 

  2. O. Pironneau and E. Polak, “Rate of convergence of a class of methods of feasible directions,” SIAM J. Numer. Anal.,10, No. 1 (1973).

  3. Ya. I. Zabotin and M. I. Kreinin, “Convergence of methods of minimax finding,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 10 (1977).

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

    Google Scholar 

  5. D. B. Yudin and E. G. Gol'shtein, Linear Programming [in Russian], Nauka, Moscow (1963).

    Google Scholar 

Download references

Authors

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 7, pp. 65–74, 1979.

In conclusion, the author wishes to thank Ya. I. Zabotin for his interest in the present paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kostyukov, Y.A. Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent. J Math Sci 43, 2461–2467 (1988). https://doi.org/10.1007/BF01095652

Download citation

  • Issue Date:

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

Keywords

Navigation