{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:39:38Z","timestamp":1777552778290,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T00:00:00Z","timestamp":1400284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10107-014-0769-x","type":"journal-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T09:27:23Z","timestamp":1400232443000},"page":"321-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Incremental constraint projection methods for variational inequalities"],"prefix":"10.1007","volume":"150","author":[{"given":"Mengdi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri P.","family":"Bertsekas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,17]]},"reference":[{"key":"769_CR1","unstructured":"Bauschke, H.H.: Projection algorithms and monotone operators. Ph.D. thesis, Simon Frazer University, Canada (1996)"},{"key":"769_CR2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"769_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/204\/02620","volume":"204","author":"H Bauschke","year":"1997","unstructured":"Bauschke, H., Borwein, J.M., Lewis, A.S.: The method of cyclic projections for closed convex sets in hilbert space. Contemp. Math. 204, 1\u201338 (1997)","journal-title":"Contemp. Math."},{"key":"769_CR4","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/s11768-011-1005-3","volume":"9","author":"DP Bertsekas","year":"2010","unstructured":"Bertsekas, D.P.: Approximate policy iteration: a survey and some new methods. J. Control Theory Appl. 9, 310\u2013335 (2010)","journal-title":"J. Control Theory Appl."},{"key":"769_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. Ser. B 129, 163\u2013195 (2011)","journal-title":"Math. Program. Ser. B"},{"key":"769_CR6","doi-asserted-by":"crossref","first-page":"2128","DOI":"10.1109\/TAC.2011.2115290","volume":"56","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Temporal difference methods for general projected equations. IEEE Trans. Autom. Control 56, 2128\u20132139 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"769_CR7","volume-title":"Dynamic Programming and Optimal Control, vol. II: Approximate Dynamic Programming","author":"DP Bertsekas","year":"2012","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. II: Approximate Dynamic Programming. Athena Scientific, Belmont (2012)"},{"key":"769_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0120965","volume":"17","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P., Gafni, E.M.: Projection methods for variational inequalities with application to the traffic assignment problem. Math. Program. Study 17, 139\u2013159 (1982)","journal-title":"Math. Program. Study"},{"key":"769_CR9","volume-title":"Convex Analysis and Optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P., Nedi\u0107, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)"},{"key":"769_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-93-86279-38-5","volume-title":"Stochastic Approximation: A Dynamical Systems Viewpoint","author":"VS Borkar","year":"2008","unstructured":"Borkar, V.S.: Stochastic Approximation: A Dynamical Systems Viewpoint. Cambridge University Press, Cambridge (2008)"},{"key":"769_CR11","volume-title":"Neuro-dynamic Programming","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-dynamic Programming. Athena Scientific, Belmont (1996)"},{"key":"769_CR12","first-page":"461","volume":"9","author":"Y Censor","year":"2008","unstructured":"Censor, Y., Gibali, A.: Projections onto super-half-spaces for monotone variational inequality problems in finite-dimensional spaces. J. Nonlinear Convex Anal 9, 461\u2013475 (2008)","journal-title":"J. Nonlinear Convex Anal"},{"key":"769_CR13","doi-asserted-by":"crossref","first-page":"4596","DOI":"10.1016\/j.na.2012.01.021","volume":"75","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Gibali, A., Reich, S.: A von neumann alternating method for finding common solutions to variational inequalities. Nonlinear Anal. Ser. A Theory Methods Appl. 75, 4596\u20134603 (2012)","journal-title":"Nonlinear Anal. Ser. A Theory Methods Appl."},{"key":"769_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s11228-011-0192-x","volume":"20","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Gibali, A., Reich, S., Sabach, S.: Common solutions to variational inequalities. Set-Valued Var. Anal. 20, 229\u2013247 (2012)","journal-title":"Set-Valued Var. Anal."},{"key":"769_CR15","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1137\/070698750","volume":"19","author":"A Cegielski","year":"2008","unstructured":"Cegielski, A., Suchocka, A.: Relaxed alternating projection methods. SIAM J. Optim. 19, 1093\u20131106 (2008)","journal-title":"SIAM J. Optim."},{"key":"769_CR16","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1120.1044","volume":"60","author":"VV Desai","year":"2012","unstructured":"Desai, V.V., Farias, V.F., Moallemi, C.C.: Approximate dynamic programming via a smoothed approximate linear program. Oper. Res. 60, 655\u2013674 (2012)","journal-title":"Oper. Res."},{"key":"769_CR17","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1287\/opre.51.6.850.24925","volume":"51","author":"DP Farias de","year":"2003","unstructured":"de Farias, D.P., Van Roy, B.: The linear programming approach to approximate dynamic programming. Oper. Res. 51, 850\u2013865 (2003)","journal-title":"Oper. Res."},{"key":"769_CR18","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.1040.0094","volume":"29","author":"DP Farias de","year":"2004","unstructured":"de Farias, D.P., Van Roy, B.: On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. 29, 462\u2013478 (2004)","journal-title":"Math. Oper. Res."},{"key":"769_CR19","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.jat.2006.02.005","volume":"142","author":"F Deutsch","year":"2006","unstructured":"Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm i: angles between convex sets. J. Approx. Theory 142, 36\u201355 (2006)","journal-title":"J. Approx. Theory"},{"key":"769_CR20","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.jat.2006.02.006","volume":"142","author":"F Deutsch","year":"2006","unstructured":"Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm ii: norms of nonlinear operators. J. Approx. Theory 142, 56\u201382 (2006)","journal-title":"J. Approx. Theory"},{"key":"769_CR21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jat.2008.04.001","volume":"155","author":"F Deutsch","year":"2008","unstructured":"Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm iii: regularity of convex sets. J. Approx. Theory 155, 155\u2013184 (2008)","journal-title":"J. Approx. Theory"},{"key":"769_CR22","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)"},{"key":"769_CR23","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BF01589441","volume":"35","author":"M Fukushima","year":"1986","unstructured":"Fukushima, M.: A relaxed projection method for variational inequalities. Math. Program. 35, 58\u201370 (1986)","journal-title":"Math. Program."},{"key":"769_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s101070050024","volume":"84","author":"G Gurkan","year":"1999","unstructured":"Gurkan, G., Ozge, A.Y., Robinson, S.M.: Sample-path solution of stochastic variational inequalities. Math. Program. 84, 313\u2013333 (1999)","journal-title":"Math. Program."},{"key":"769_CR25","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"LG Gubin","year":"1967","unstructured":"Gubin, L.G., Polyak, B.T., Raik, E.V.: The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. 7, 1211\u20131228 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"769_CR26","first-page":"96","volume":"23","author":"I Halperin","year":"1962","unstructured":"Halperin, I.: The product of projection operators. Acta Sci. Math. 23, 96\u201399 (1962)","journal-title":"Acta Sci. Math."},{"key":"769_CR27","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1109\/TAC.2008.925853","volume":"53","author":"H Jiang","year":"2008","unstructured":"Jiang, H., Xu, F.: Stochastic approximation approaches to the stochastic variational inequality problem. IEEE Trans. Autom. Control 53, 1462\u20131475 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"key":"769_CR28","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TAC.2012.2215413","volume":"58","author":"J Koshal","year":"2013","unstructured":"Koshal, J., Nedi\u0107, A., Shanbhag, U.V.: Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Autom. Control 58, 594\u2013608 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"769_CR29","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: An extragradient method for finding saddle points and for other problems. Matecon 12, 747\u2013756 (1976)","journal-title":"Matecon"},{"key":"769_CR30","doi-asserted-by":"crossref","unstructured":"Krasnoselskii, M.A.: Approximate Solution of Operator Equations. D. Wolters-Noordhoff Pub, Groningen (1972)","DOI":"10.1007\/978-94-010-2715-1"},{"key":"769_CR31","volume-title":"An Introduction to Variational Inequalities and Their Applications","author":"D Kinderlehrer","year":"1980","unstructured":"Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic Press, New York, London (1980)"},{"key":"769_CR32","doi-asserted-by":"crossref","unstructured":"Kannan, A., Shanbhag, U.V.: Distributed computation of equilibria in monotone nash games via iterative regularization techniques. SIAM J. Optim. 22(4), 1177\u20131205 (2012)","DOI":"10.1137\/110825352"},{"key":"769_CR33","volume-title":"Stochastic Approximation and Recursive Algorithms and Applications","author":"HJ Kushner","year":"2003","unstructured":"Kushner, H.J., Yin, G.: Stochastic Approximation and Recursive Algorithms and Applications. Springer, New York (2003)"},{"key":"769_CR34","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35, 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"key":"769_CR35","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/moor.1070.0291","volume":"33","author":"AS Lewis","year":"2008","unstructured":"Lewis, A.S., Malick, J.: Alternating projections on manifolds. Math. Oper. Res. 33, 216\u2013234 (2008)","journal-title":"Math. Oper. Res."},{"key":"769_CR36","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1287\/moor.1120.0579","volume":"38","author":"S Lu","year":"2013","unstructured":"Lu, S.: Confidence regions for stochastic variational inequalities. Math. Oper. Res. 38, 545\u2013569 (2013)","journal-title":"Math. Oper. Res."},{"key":"769_CR37","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Convergence rate of the incremental subgradient algorithm. In: Uryasev, S., Pardalos, P.M. (eds.) Stochastic Optimization: Algorithms and Applications, pp. 263\u2013304 (2000)","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"769_CR38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12, 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"key":"769_CR39","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A.: Random projection algorithms for convex set intersection problems. In: The 49th IEEE conference on decision and control, Atlanta, Georgia, pp. 7655\u20137660 (2010)","DOI":"10.1109\/CDC.2010.5717734"},{"key":"769_CR40","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-011-0468-9","volume":"129","author":"A Nedi\u0107","year":"2011","unstructured":"Nedi\u0107, A.: Random algorithms for convex minimization problems. Math. Program. Ser. B 129, 225\u2013253 (2011)","journal-title":"Math. Program. Ser. B"},{"key":"769_CR41","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"769_CR42","first-page":"197","volume":"152","author":"MA Noor","year":"2004","unstructured":"Noor, M.A.: Some developments in general variational inequalities. Appl. Math. Comput. 152, 197\u2013277 (2004)","journal-title":"Appl. Math. Comput."},{"key":"769_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2991-7","volume-title":"Nonlinear Programing and Variational Inequality Problems: A Unified Approach","author":"M Patriksson","year":"1999","unstructured":"Patriksson, M.: Nonlinear Programing and Variational Inequality Problems: A Unified Approach. Kluwer, Dordrecht, The Netherlands (1999)"},{"key":"769_CR44","unstructured":"Recht, B., Re, C.: Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences. arXiv:1202.4184 (2012)"},{"key":"769_CR45","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems 2nd edn. SIAM, Philadelphia (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"769_CR46","volume-title":"Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning. MIT Press, Cambridge (1998)"},{"key":"769_CR47","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"769_CR48","doi-asserted-by":"crossref","unstructured":"Shapiro, A.: Monte Carlo sampling methods. In: Stochastic Programming. Handbook in OR & MS, vol. 10, North-Holland, Amsterdam (2003)","DOI":"10.1016\/S0927-0507(03)10006-0"},{"key":"769_CR49","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02575559","volume":"7","author":"M Sibony","year":"1970","unstructured":"Sibony, M.: Methodes iteratives pour les equations et inequations aux derivees partielles non lineaires de type monotone. Calcolo 7, 65\u2013183 (1970)","journal-title":"Calcolo"},{"key":"769_CR50","doi-asserted-by":"crossref","unstructured":"Tseng, P.: Successive projection under a quasi-cyclic order. Laboratory for Information and Decision Systems Report LIDS-P-1938, MIT, Cambridge, MA (1990)","DOI":"10.21236\/ADA458804"},{"key":"769_CR51","volume-title":"Functional Operators","author":"J Neumann von","year":"1950","unstructured":"von Neumann, J.: Functional Operators. Princeton University Press, Princeton (1950)"},{"key":"769_CR52","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection-proximal methods for nonsmooth convex optimization. Laboratory for Information and Decision Systems, Report LIDS-P-2907, MIT (2013)"},{"key":"769_CR53","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1142\/S0217595910002569","volume":"27","author":"H Xu","year":"2010","unstructured":"Xu, H.: Sample average approximation methods for a class of stochastic variational inequality problems. Asian Pac. J. Oper. Res. 27, 103\u2013119 (2010)","journal-title":"Asian Pac. J. Oper. Res."},{"key":"769_CR54","doi-asserted-by":"crossref","unstructured":"Xiu, N., Zhang, J.: Some recent advances in projection-type methods for variational inequalities. J. Comput. Appl. Math. 152, 559\u2013585 (2003)","DOI":"10.1016\/S0377-0427(02)00730-6"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0769-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0769-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0769-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T14:34:25Z","timestamp":1565447665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0769-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,17]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["769"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0769-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,17]]}}}