Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities

References

• Bach F, Moulines E (2011) Non-asymptotic analysis of stochastic approximation algorithms for machine learning. Shawe-Taylor J, Zemel RS, Bartlett PL, Pereira F, Weinberger KQ, eds. Advances in Neural Information Processing Systems, Vol. 24 (MIT Press, Cambridge, MA).Google Scholar
• Bauschke HH (2001) Projection algorithms: Results and open problems. Butnariu D, Censor Y, Reich Y, eds. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Elsevier, Amsterdam), 11–22.Crossref, Google Scholar
• Bauschke HH, Borwein JM (1996) On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3):367–426.Crossref, Google Scholar
• Bello Cruz JY, Iusem AN (2010) Convergence of direct methods for paramonotone variational inequalities. Comput. Optim. Appl. 46(2):247–263.Crossref, Google Scholar
• Bello Cruz JY, Iusem AN (2012) An explicit algorithm for monotone variational inequalities. Optimization 61(7):855–871.Crossref, Google Scholar
• Bello Cruz JY, Iusem AN (2015) Full convergence of an approximate projections method for nonsmooth variational inequalities. Math. Comput. Simulation 114(August):2–13.Crossref, Google Scholar
• Bertsekas DP (2011) Incremental proximal methods for large scale convex optimization. Math. Program. 129(2):163–195.Crossref, Google Scholar
• Burke JV, Ferris MC (1993) Weak sharp minima in mathematical programming. SIAM J. Control Optim. 31(5):1340–1359.Crossref, Google Scholar
• Cegielski A, Suchocka A (2008) Relaxed alternating projection methods. SIAM J. Optim. 19(3):1093–1106.Crossref, Google Scholar
• Censor Y (1981) Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23(4):444–466.Crossref, Google Scholar
• Censor Y, Gibali A (2008) Projections onto super-half-spaces for monotone variational inequality problems in finite-dimensional space. J. Nonlinear Convex Anal. 9(3):461–475.Google Scholar
• Censor Y, De Pierro AR, Zaknoon M (2004) Steered sequential projections for the inconsistent convex feasibility problem. Nonlinear Anal. 59(3):385–405.Crossref, Google Scholar
• Chen Y, Lan G, Ouyang Y (2017) Accelerated schemes for a class of variational inequalities. Math. Program. 165(1):113–149.Crossref, Google Scholar
• Chen X, Wets RJ-B, Zhang Y (2012) Stochastic variational inequalities: Residual minimization smoothing sample average approximations. SIAM J. Optim. 22(2):649–673.Crossref, Google Scholar
• Deutsch F, Hundal H (2008) The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets. J. Approx. Theory 155(2):155–184.Crossref, Google Scholar
• Facchinei F, Pang J-S (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. I (Springer-Verlag, New York).Google Scholar
• Fukushima M (1986) A relaxed projection method for variational inequalities. Math. Programming 35(1):58–70.Crossref, Google Scholar
• Huang J, Subramanian VG, Agrawal R, Berry R (2009) Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks. IEEE J. Selected Areas Comm. 27(2):226–234.Crossref, Google Scholar
• Iusem AN (1998) On some properties of paramonotone operators. J. Convex Anal. 5(2):269–278.Google Scholar
• Iusem AN, Svaiter BF (1997) A variant of Korpelevich’s method for variational inequalities with a new search strategy. Optimization 42(4):309–321.Crossref, Google Scholar
• Jiang H, Xu H (2008) Stochastic approximation approaches to the stochastic variational inequality problem. IEEE Trans. Automat. Control 53(6):1462–1475.Crossref, Google Scholar
• Jofré A, Luc TD, Théra M (1998) ε-subdifferential and ε-monotonicity. Nonlinear Anal. 33(1):71–90.Crossref, Google Scholar
• Juditsky A, Nemirovski A, Tauvel C (2011) Solving variational inequalities with stochastic mirror-prox algorithm. Stochastic Systems 1(1):17–58.Link, Google Scholar
• Kannan A, Shanbhag UV (2012) Distributed computation of equilibria in monotone Nash games via iterative regularization techniques. SIAM J. Optim. 22(4):1177–1205.Crossref, Google Scholar
• Kannan A, Shanbhag UV (2014) Pseudomonotone stochastic variational inequality problems: Analysis and stochastic approximation schemes. 2014 American Control Conf. June 4–6 (IEEE, New York).Google Scholar
• Kibardin VM (1979) Decomposition into functions in the minimization problem. Avtomat. i Telemekh. 9(1):66–79.Google Scholar
• King AJ, Rockafellar RT (1993) Asymptotic theory for solutions in statistical estimation and stochastic programming. Math. Oper. Res. 18(1):148–162.Link, Google Scholar
• Koshal J, Nedić A, Shanbhag UV (2013) Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Automat. Control 58(3):594–609.Crossref, Google Scholar
• Luo Z-Q, Tseng P (1994) Analysis of an approximate gradient projection method with applications to the backpropagation algorithm. Optim. Methods Software 4(2):85–101.Crossref, Google Scholar
• Marcotte P, Zhu D (1999) Weak sharp solutions of variational inequalities. SIAM J. Optim. 9(1):179–189.Crossref, Google Scholar
• Nedić A (2011) Random algorithms for convex minimization problems. Math. Program. 129(2):225–253.Crossref, Google Scholar
• Nemirovski A (2004) Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1):229–251.Crossref, Google Scholar
• Nemirovski A, Juditsky A, Lan G, Shapiro A (2008) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Crossref, Google Scholar
• Pang J-S (1997) Error bounds in mathematical programming. Math. Programming 79(1–3):299–332.Crossref, Google Scholar
• Polyak BT (1969) Minimization of unsmooth functionals. USSR Computational Math. Math. Phys. 9(3):14–29.Crossref, Google Scholar
• Polyak BT (1987) Introduction to Optimization (Optimization Software Inc., New York).Google Scholar
• Polyak BT (2001) Random algorithms for solving convex inequalities. Butnariu D, Censor Y, Reich S, eds. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Elsevier, Amsterdam), 409–422.Crossref, Google Scholar
• Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statistics 22(3):400–407.Crossref, Google Scholar
• Robbins H, Siegmund DO (1971) A convergence theorem for nonnegative almost super-martingales and some applications. Rustagi JS, ed. Optimizing Methods in Statistics (Proc. Sympos. Ohio State Univ., Columbus, Ohio) (Academic Press, New York), 233–257.Google Scholar
• Wang M, Bertsekas D (2015) Incremental constraint projection methods for variational inequalities. Math. Program. 150(2):321–363.Crossref, Google Scholar
• Wang M, Bertsekas D (2016) Stochastic first-order methods with random constraint projection. SIAM J. Optim. 26(1):681–717.Crossref, Google Scholar
• Yousefian F, Nedić A, Shanbhag UV (2014) Optimal robust smoothing extragradient algorithms for stochastic variational inequality problems. Proc. IEEE Conf. Decision and Control, Los Angeles (IEEE, New York).Google Scholar
• Yousefian F, Nedić A, Shanbhag UV (2016) Self-tuned stochastic approximation schemes for non-Lipschitzian stochastic multi-user optimization and Nash games. IEEE Trans. Automat. Control 61(7):1753–1766.Crossref, Google Scholar
• Yousefian F, Nedić A, Shanbhag UV (2017) On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. Math. Program. 165(1):391–431.Crossref, Google Scholar