Solving variational inequalities with Stochastic Mirror-Prox algorithm
暂无分享,去创建一个
[1] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[2] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[3] Leonid Khachiyan,et al. A sublinear-time randomized approximation algorithm for matrix games , 1995, Oper. Res. Lett..
[4] Arkadi Nemirovski,et al. Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems , 2004, SIAM J. Optim..
[5] Yurii Nesterov,et al. Excessive Gap Technique in Nonsmooth Convex Minimization , 2005, SIAM J. Optim..
[6] Yurii Nesterov,et al. Smooth minimization of non-smooth functions , 2005, Math. Program..
[7] Arkadi Nemirovski,et al. Non-euclidean restricted memory level method for large-scale convex optimization , 2005, Math. Program..
[8] Yurii Nesterov,et al. Dual extrapolation and its applications to solving variational inequalities and related problems , 2003, Math. Program..
[9] Renato D. C. Monteiro,et al. Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm , 2007, Math. Program..
[10] A. Juditsky,et al. Large Deviations of Vector-valued Martingales in 2-Smooth Normed Spaces , 2008, 0809.0813.
[11] Alexander Shapiro,et al. Stochastic Approximation approach to Stochastic Programming , 2013 .
[12] Uriel G. Rothblum,et al. Accuracy Certificates for Computational Problems with Convex Structure , 2010, Math. Oper. Res..