{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T11:38:35Z","timestamp":1725449915173},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T00:00:00Z","timestamp":1323734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10957-011-9975-3","type":"journal-article","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T16:03:48Z","timestamp":1323705828000},"page":"602-618","source":"Crossref","is-referenced-by-count":6,"title":["The Extragradient Method for Solving Variational Inequalities in the Presence of Computational Errors"],"prefix":"10.1007","volume":"153","author":[{"given":"A. J.","family":"Zaslavski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,13]]},"reference":[{"key":"9975_CR1","first-page":"23","volume":"81","author":"Ya.I. Alber","year":"1998","unstructured":"Alber, Ya.I., Iusem, A.N., Solodov, M.V.: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math. Program. 81, 23\u201335 (1998)","journal-title":"Math. Program."},{"key":"9975_CR2","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1287\/moor.1070.0253","volume":"32","author":"K. Barty","year":"2007","unstructured":"Barty, K., Roy, J.-S., Strugarek, C.: Hilbert-valued perturbed subgradient algorithms. Math. Oper. Res. 32, 551\u2013562 (2007)","journal-title":"Math. Oper. Res."},{"key":"9975_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/02331939508844042","volume":"32","author":"R.S. Burachik","year":"1995","unstructured":"Burachik, R.S., Grana Drummond, L.M., Iusem, A.N., Svaiter, B.F.: Full convergence of the steepest descent method with inexact line searches. Optimization 32, 137\u2013146 (1995)","journal-title":"Optimization"},{"key":"9975_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1590\/S0101-82052009000100002","volume":"28","author":"R.S. Burachik","year":"2009","unstructured":"Burachik, R.S., Lopes, J.O., Da Silva, G.J.P.: An inexact interior point proximal method for the variational inequality. Comput. Appl. Math. 28, 15\u201336 (2009)","journal-title":"Comput. Appl. Math."},{"key":"9975_CR5","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/s10957-010-9757-3","volume":"148","author":"Y. Censor","year":"2011","unstructured":"Censor, Y., Gibali, A., Reich, S.: The subgradient extragradient method for solving variational inequalities in Hilbert space. J. Optim. Theory Appl. 148, 318\u2013335 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"9975_CR6","volume-title":"Nondifferentiable Optimization","author":"V.F. Demyanov","year":"1981","unstructured":"Demyanov, V.F., Vasil\u2019ev, L.V.: Nondifferentiable Optimization. Nauka, Moscow (1981)"},{"key":"9975_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.7153\/jmi-03-44","volume":"3","author":"J. Gwinner","year":"2009","unstructured":"Gwinner, J., Raciti, F.: On monotone variational inequalities with random data. J. Math. Inequal. 3, 443\u2013453 (2009)","journal-title":"J. Math. Inequal."},{"key":"9975_CR8","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1080\/10556780801995790","volume":"23","author":"E. Huebner","year":"2008","unstructured":"Huebner, E., Tichatschke, R.: Relaxed proximal point algorithms for variational inequalities with multi-valued operators. Optim. Methods Softw. 23, 847\u2013877 (2008)","journal-title":"Optim. Methods Softw."},{"key":"9975_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/02331930600809259","volume":"56","author":"A. Kaplan","year":"2007","unstructured":"Kaplan, A., Tichatschke, R.: Bregman-like functions and proximal methods for variational problems with nonlinear constraints. Optimization 56, 253\u2013265 (2007)","journal-title":"Optimization"},{"key":"9975_CR10","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"K.C. Kiwiel","year":"2003","unstructured":"Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14, 807\u2013840 (2003)","journal-title":"SIAM J. Optim."},{"key":"9975_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.3103\/S1066369X09080052","volume":"53","author":"I.V. Konnov","year":"2009","unstructured":"Konnov, I.V.: A descent method with inexact linear search for mixed variational inequalities. Russ. Math. 53, 29\u201335 (2009)","journal-title":"Russ. Math."},{"key":"9975_CR12","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1007\/s11228-008-0102-z","volume":"16","author":"P.-E. Mainge","year":"2008","unstructured":"Mainge, P.-E.: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 16, 899\u2013912 (2008)","journal-title":"Set-Valued Anal."},{"key":"9975_CR13","first-page":"747","volume":"12","author":"G.M. Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Ekonom. Mat. Metody 12, 747\u2013756 (1976)","journal-title":"Ekonom. Mat. Metody"},{"key":"9975_CR14","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, vols.\u00a0I\u2013II. Springer, New York (2003)"},{"key":"9975_CR15","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1080\/01630563.2010.489248","volume":"31","author":"A.J. Zaslavski","year":"2010","unstructured":"Zaslavski, A.J.: The projected subgradient method for nonsmooth convex optimization in the presence of computational errors. Numer. Funct. Anal. Optim. 31, 616\u2013633 (2010)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9975_CR16","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1137\/090766930","volume":"20","author":"A.J. Zaslavski","year":"2010","unstructured":"Zaslavski, A.J.: Convergence of a proximal method in the presence of computational errors in Hilbert spaces. SIAM J. Optim. 20, 2413\u20132421 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9975-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-011-9975-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9975-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:14Z","timestamp":1559469314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-011-9975-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,13]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9975"],"URL":"https:\/\/doi.org\/10.1007\/s10957-011-9975-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,13]]}}}