{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:55:51Z","timestamp":1763535351848,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,11,5]],"date-time":"2015-11-05T00:00:00Z","timestamp":1446681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271112"],"award-info":[{"award-number":["11271112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Program for Science and Technology Innovation Talents in the Universities of the Henan Province","award":["15HASTIT013"],"award-info":[{"award-number":["15HASTIT013"]}]},{"name":"The Scientific Research Foundation for Ph.D. of Henan Normal University","award":["qd14144"],"award-info":[{"award-number":["qd14144"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10957-015-0835-4","type":"journal-article","created":{"date-parts":[[2015,11,5]],"date-time":"2015-11-05T16:45:27Z","timestamp":1446741927000},"page":"901-916","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Error Sensitivity for Strongly Convergent Modifications of the Proximal Point Algorithm"],"prefix":"10.1007","volume":"168","author":[{"given":"Yamin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fenghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Kun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,5]]},"reference":[{"key":"835_CR1","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT 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":"835_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"G\u00fcler, O.: On the convergence of the proximal point algorithm for convex optimization. SIAM J. Control Optim. 29, 403\u2013419 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"835_CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s101079900113","volume":"87","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: Forcing strong convergence of proximal point iterations in a Hilbert space. Math. Progr. Ser. A 87, 189\u2013202 (2000)","journal-title":"Math. Progr. Ser. A"},{"key":"835_CR4","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1137\/S105262340139611X","volume":"13","author":"S Kamimura","year":"2003","unstructured":"Kamimura, S., Takahashi, W.: Strong convergence of a proximal-type algorithm in a Banach space. SIAM J. Optim. 13, 938\u2013945 (2003)","journal-title":"SIAM J. Optim."},{"key":"835_CR5","doi-asserted-by":"crossref","first-page":"791","DOI":"10.3934\/cpaa.2004.3.791","volume":"3","author":"G Marino","year":"2004","unstructured":"Marino, G., Xu, H.K.: Convergence of generalized proximal point algorithm. Comm. Pure Appl. Anal. 3, 791\u2013808 (2004)","journal-title":"Comm. Pure Appl. Anal."},{"key":"835_CR6","first-page":"113","volume":"83","author":"J Eckstein","year":"1998","unstructured":"Eckstein, J.: Approximate iterations in Bregman-function-based proximal algorithms. Math. Progr. 83, 113\u2013123 (1998)","journal-title":"Math. Progr."},{"key":"835_CR7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1006\/jmaa.2001.7535","volume":"263","author":"D Han","year":"2001","unstructured":"Han, D., He, B.S.: A new accuracy criterion for approximate proximal point algorithms. J. Math. Anal. Appl. 263, 343\u2013354 (2001)","journal-title":"J. Math. Anal. Appl."},{"key":"835_CR8","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"HK Xu","year":"2002","unstructured":"Xu, H.K.: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66, 240\u2013256 (2002)","journal-title":"J. Lond. Math. Soc."},{"key":"835_CR9","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10898-010-9611-z","volume":"50","author":"F Wang","year":"2011","unstructured":"Wang, F.: A note on the regularized proximal point algorithm. J. Glob. Optim. 50, 531\u2013535 (2011)","journal-title":"J. Glob. Optim."},{"key":"835_CR10","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s11590-010-0176-z","volume":"4","author":"OA Boikanyo","year":"2010","unstructured":"Boikanyo, O.A., Morosanu, G.: A proximal point algorithm converging strongly for general errors. Optim. Lett. 4, 635\u2013641 (2010)","journal-title":"Optim. Lett."},{"key":"835_CR11","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.na.2010.09.008","volume":"74","author":"OA Boikanyo","year":"2011","unstructured":"Boikanyo, O.A., Morosanu, G.: Four parameter proximal point algorithms. Nonlinear Anal. 74, 544\u2013555 (2011)","journal-title":"Nonlinear Anal."},{"key":"835_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10898-006-9002-7","volume":"36","author":"HK 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":"835_CR13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.cam.2007.06.013","volume":"217","author":"Y Yao","year":"2008","unstructured":"Yao, Y., Noor, M.A.: On convergence criteria of generalized proximal point algorithms. J. Comput. Appl. Math. 217, 46\u201355 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"835_CR14","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10898-011-9772-4","volume":"54","author":"F Wang","year":"2012","unstructured":"Wang, F., Cui, H.: On the contraction-proximal point algorithms with multi-parameters. J. Global Optim. 54, 485\u2013491 (2012)","journal-title":"J. Global Optim."},{"key":"835_CR15","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1006\/jath.2000.3493","volume":"106","author":"S Kamimura","year":"2000","unstructured":"Kamimura, S., Takahashi, W.: Approximating solutions of maximal monotone operators in Hilbert spaces. J. Approx. Theory 106, 226\u2013240 (2000)","journal-title":"J. Approx. Theory"},{"key":"835_CR16","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.11650\/twjm\/1500405080","volume":"12","author":"L Ceng","year":"2008","unstructured":"Ceng, L., Wu, S., Yao, J.: New accuracy criteria for modified approximate proximal point algorithms in Hilbert spaces. Taiwan J. Math. 12, 1691\u20131705 (2008)","journal-title":"Taiwan J. Math."},{"key":"835_CR17","doi-asserted-by":"crossref","unstructured":"Tian, C., Wang, F.: The contraction-proximal point algorithm with square-summable errors. Fixed Point Theory and Applications 2013, 93, 10 pages (2013)","DOI":"10.1186\/1687-1812-2013-93"},{"key":"835_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526152","volume-title":"Topics on Metric Fixed Point Theory","author":"K Goebel","year":"1990","unstructured":"Goebel, K., Kirk, W.A.: Topics on Metric Fixed Point Theory. Cambridge University Press, Cambridge (1990)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0835-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-015-0835-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0835-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T04:52:33Z","timestamp":1567313553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-015-0835-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["835"],"URL":"https:\/\/doi.org\/10.1007\/s10957-015-0835-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2015,11,5]]}}}