Abstract
The problem of the speed of convergence in the method of Fejer approximations is examined, with an application to the problem of finding at least one solution of the system of inequalitiesf j(x) ≤ 0, j=1,..., m, where thefj(x) are smooth convex functions defined on a real Hilbert space.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
I. I. Eremin, “A relaxation method for solving systems of inequalities having convex functions in their left members,” Dokl. Akad. Nauk SSSR,160, No. 5, 994–996 (1965).
I. I. Eremin, “On systems of inequalities with convex functions in their left members,” Izv. Akad. Nauk SSSR, Ser. Matem.,30, No. 2, 265–278 (1966).
I. I. Eremin, “On some iterational methods in convex programming,” Ékonomika i Matematicheskie Metody, No. 6, 870–886 (1966).
G. Zoitendeik, Methods of Possible Directions [in Russian], Moscow (1963).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 4, No. 1, pp. 53–62, July, 1968.
Rights and permissions
About this article
Cite this article
Eremin, I.I. On the speed of convergence in the method of Fejer approximations. Mathematical Notes of the Academy of Sciences of the USSR 4, 522–527 (1968). https://doi.org/10.1007/BF01429814
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01429814