Skip to main content
SpringerLink
Log in

Methods of fejer's approximations in convex programming

  • Published:
Mathematical notes of the Academy of Sciences of the USSR 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. S. N. Chernikov, “Systems of linear inequalities,” Uspekhi Matem. Nauk,8, No. 2 (1953).

  2. S. N. Chernikov, “Contracting finite systems of linear inequalities,” Zh. Vychisl. Matem. i Matem. Fiz.,5, No. 1 (1965).

  3. S. N. Chernikov, “Algebraic theory of linear inequalities,” Ukr. Matem. Zh.,19, No. 1 (1967).

  4. Ky Fan, “On systems of linear inequalities,” Ann. Math. Studies,38 (1956).

  5. S. Agmon, “The relaxation method for linear inequalities,” Canad. J. Math.,6, No. 3 (1954).

  6. T. S. Motzkin and I. J. Schoenberg, “The relaxation method for linear inequalities,” Canad. J. Math.,6, No. 3 (1954).

  7. V. A. Bulavskii, “Iteration method for solving the general problem of linear programming,” Sib. Matem. Zh.,3, No. 3 (1962).

  8. R. Courant, “Variational methods for the solution of problems of equilibrium and vibrations,” Bull. Amer. Math. Soc.,49 (1943).

  9. I. I. Eremin, “Inconsistent systems of linear inequalities,” Dokl. Akad. Nauk SSSR,138, No. 6 (1961).

  10. I. I. Eremin, “Iterational methods for Chebyshev approximations of inconsistent systems of linear inequalities,” Dokl. Akad. Nauk SSSR,143, No. 6 (1962).

  11. I. I. Eremin, “A generalization of the relaxation method of Motzkin and Agmon,” Uspekhi Matem. Nauk,20, No. 2 (1965).

  12. I. I. Eremin, “The relaxation method for solving systems of inequalities with convex functions on the left-hand sides,” Dokl. Akad. Nauk SSSR,160, No. 5 (1965).

  13. I. I. Eremin and V. D. Mazurov, “Iterational method for solving convex programming problems,” Matematicheskie Zapiski Ural'skogo inst.,5, No. 3 (1966).

  14. I. I. Eremin, “Systems of inequalities with convex functions on the left-hand sides,” Izv. Akad. Nauk SSSR, Ser. Matem.,30, No. 2 (1966).

  15. I. I. Eremin, “Some iterational methods in convex programming,” Ekonomika i Matematicheskie Metody,2, No. 6 (1966).

  16. I. I. Eremin and V. D. Mazurov, “An iterational method for solving convex programming problems,” Dokl. Akad. Nauk SSSR (1956).

  17. I. I. Eremin, “The penalty method in convex programming,” Contrib. International Mathem. Congress, Section 14 (ICM, Moscow, 1966).

    Google Scholar 

  18. I. I. Eremin, “The penalty method in convex programming,” Dokl. Akad. Nauk SSSR,173, No. 4 (1967).

  19. I. I. Eremin, “The penalty method in convex programming,” Kibernetika, No. 4 (1967).

Download references

Authors
  1. I. I. Eremin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 3, No. 2, pp. 217–234, February, 1968.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eremin, I.I. Methods of fejer's approximations in convex programming. Mathematical Notes of the Academy of Sciences of the USSR 3, 139–149 (1968). https://doi.org/10.1007/BF01094336

Download citation

  • Issue Date:

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

Keywords

Search

Navigation