{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:23:37Z","timestamp":1773231817984,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T00:00:00Z","timestamp":1301011200000},"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":[[2011,7]]},"DOI":"10.1007\/s10957-011-9820-8","type":"journal-article","created":{"date-parts":[[2011,3,24]],"date-time":"2011-03-24T15:56:40Z","timestamp":1300982200000},"page":"20-32","source":"Crossref","is-referenced-by-count":17,"title":["Maximal Monotone Operators and the Proximal Point Algorithm in the Presence of Computational Errors"],"prefix":"10.1007","volume":"150","author":[{"given":"A. J.","family":"Zaslavski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,25]]},"reference":[{"key":"9820_CR1","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"H.H. Bauschke","year":"2003","unstructured":"Bauschke, H.H., Borwein, J.M., Combettes, P.L.: Bregman monotone optimization algorithms. SIAM J. Control Optim. 42, 596\u2013636 (2003)","journal-title":"SIAM J. Control Optim."},{"key":"9820_CR2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/070687542","volume":"19","author":"H.H. Bauschke","year":"2008","unstructured":"Bauschke, H.H., Goebel, R., Lucet, Y., Wang, X.: The proximal average: basic theory. SIAM J. Optim. 19, 766\u2013785 (2008)","journal-title":"SIAM J. Optim."},{"key":"9820_CR3","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":"9820_CR4","doi-asserted-by":"crossref","first-page":"2096","DOI":"10.1137\/070682071","volume":"47","author":"D. Butnariu","year":"2008","unstructured":"Butnariu, D., Kassay, G.: A proximal-projection method for finding zeros of set-valued operators. SIAM J. Control Optim. 47, 2096\u20132136 (2008)","journal-title":"SIAM J. Control Optim."},{"key":"9820_CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y. Censor","year":"1992","unstructured":"Censor, Y., Zenios, S.A.: The proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73, 451\u2013464 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"9820_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O. Guler","year":"1991","unstructured":"Guler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403\u2013419 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"9820_CR7","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1137\/060666627","volume":"46","author":"W.W. Hager","year":"2007","unstructured":"Hager, W.W., Zhang, H.: Asymptotic convergence analysis of a new class of proximal point methods. SIAM J. Control Optim. 46, 1683\u20131704 (2007)","journal-title":"SIAM J. Control Optim."},{"key":"9820_CR8","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":"9820_CR9","first-page":"9","volume":"30","author":"G. Kassay","year":"1985","unstructured":"Kassay, G.: The proximal points algorithm for reflexive Banach spaces. Stud. Univ. Babes-Bolyai Math. 30, 9\u201317 (1985)","journal-title":"Stud. Univ. Babes-Bolyai Math."},{"key":"9820_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1051\/m2an\/1978120201531","volume":"12","author":"B. Martinet","year":"1978","unstructured":"Martinet, B.: Pertubation des methodes d\u2019optimisation: application. RAIRO. Anal. Num\u00e9r. 12, 153\u2013171 (1978)","journal-title":"RAIRO. Anal. Num\u00e9r."},{"key":"9820_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"G.J. Minty","year":"1962","unstructured":"Minty, G.J.: Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29, 341\u2013346 (1962)","journal-title":"Duke Math. J."},{"key":"9820_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.2140\/pjm.1964.14.243","volume":"14","author":"G.J. Minty","year":"1964","unstructured":"Minty, G.J.: On the monotonicity of the gradient of a convex function. Pac. J. Math. 14, 243\u2013247 (1964)","journal-title":"Pac. J. Math."},{"key":"9820_CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J.J. Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximite et dualite dans un espace Hilbertien. Bull. Soc. Math. Fr. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. Fr."},{"key":"9820_CR14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"9820_CR15","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"9820_CR16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s101070050022","volume":"88","author":"M.V. Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math. Program. 88, 371\u2013389 (2000)","journal-title":"Math. Program."},{"key":"9820_CR17","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1081\/NFA-100108320","volume":"22","author":"M.V. Solodov","year":"2001","unstructured":"Solodov, M.V., Svaiter, B.F.: A unified framework for some inexact proximal point algorithms. Numer. Funct. Anal. Optim. 22, 1013\u20131035 (2001)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9820_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10898-006-9002-7","volume":"36","author":"H.-K. Xu","year":"2006","unstructured":"Xu, H.-K.: A regularization method for the proximal point algorithm. J. Glob. Optim. 36, 115\u2013125 (2006)","journal-title":"J. Glob. Optim."},{"key":"9820_CR19","first-page":"139","volume":"2","author":"N. Yamashita","year":"2001","unstructured":"Yamashita, N., Kanzow, C., Morimoto, T., Fukushima, M.: An infeasible interior proximal method for convex programming problems with linear constraints. J. Nonlinear Convex Anal. 2, 139\u2013156 (2001)","journal-title":"J. Nonlinear Convex Anal."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9820-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-011-9820-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9820-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T11:55:38Z","timestamp":1560081338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-011-9820-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,25]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9820"],"URL":"https:\/\/doi.org\/10.1007\/s10957-011-9820-8","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,25]]}}}