Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators
Author:
Kaplan A.,Tichatschke R.
Reference40 articles.
1. P. Alart
and B. Lemaire, “Penalization in non-classical convex programming via variational convergence”, Math. Programming 51 (1991) 307–331.
2. A.S. Antipin, “On a method for convex programs using a symmetrical modification of the Lagrange function”, Ekonomika i Mat. Metody 12 (1976) 1164–1173, (in Russian).
3. A. Auslender, J.P. Crouzeix
and P. Fedit, “Penalty proximal method in convex programming”, JOTA 55 (1987) 1–21.
4. G. Chen
and M. Teboulle, “A proximal-based decomposition method for convex minimization problems”, Math. Programming 64 (1994) 81–101.
5. J. Eckstein
and D.P. Bertsekas, “On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone opera-tors”, Math. Programming 55 (1992) 293–318.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献