PROX-METHOD WITH RATE OF CONVERGENCE O(1/t) FOR VARIATIONAL INEQUALITIES WITH LIPSCHITZ CONTINUOUS MONOTONE OPERATORS AND SMOOTH CONVEX-CONCAVE SADDLE POINT PROBLEMS∗
暂无分享,去创建一个
[1] G. M. Korpelevich. The extragradient method for finding saddle points and other problems , 1976 .
[2] Ronald E. Bruck. On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space , 1977 .
[3] G. Cohen. Auxiliary problem principle and decomposition of optimization problems , 1980 .
[4] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[5] Arkadi S. Nemirovsky,et al. Information-based complexity of linear operator equations , 1992, J. Complex..
[6] Marc Teboulle,et al. Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions , 1993, SIAM J. Optim..
[7] Marc Teboulle,et al. Convergence of Proximal-Like Algorithms , 1997, SIAM J. Optim..
[8] K. Kiwiel. Proximal Minimization Methods with Generalized Bregman Functions , 1997 .
[9] Marc Teboulle,et al. Mirror descent and nonlinear projected subgradient methods for convex optimization , 2003, Oper. Res. Lett..
[10] M. Noor. New extragradient-type methods for general variational inequalities , 2003 .
[11] Y. Nesterov. Dual Extrapolation and its Applications for Solving Variational Inequalities and Related Problems' , 2003 .
[12] Arkadi Nemirovski,et al. Non-euclidean restricted memory level method for large-scale convex optimization , 2005, Math. Program..