{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T09:16:38Z","timestamp":1721034998500},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T00:00:00Z","timestamp":1412899200000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10957-014-0659-7","type":"journal-article","created":{"date-parts":[[2014,10,9]],"date-time":"2014-10-09T15:46:27Z","timestamp":1412869587000},"page":"901-916","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Finite Convergence of a Projected Cutter Method"],"prefix":"10.1007","volume":"165","author":[{"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caifang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianfu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"659_CR1","doi-asserted-by":"crossref","unstructured":"Polyak, T.: Random algorithms for solving convex inequalities. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 409\u2013422. Elsevier, Amsterdam (2001)","DOI":"10.1016\/S1570-579X(01)80024-0"},{"key":"659_CR2","doi-asserted-by":"crossref","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-30901-4"},{"key":"659_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s00245-011-9139-8","volume":"64","author":"Y Censor","year":"2011","unstructured":"Censor, Y., Chen, W., Pajoohesh, H.: Finite convergence of a subgradient projection method with expanding controls. Appl. Math. Optim. 64, 273\u2013285 (2011)","journal-title":"Appl. Math. Optim."},{"key":"659_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/B:AMHU.0000028410.94541.fb","volume":"103","author":"G Crombez","year":"2004","unstructured":"Crombez, G.: Finding common fixed points of a class of paracontractions. Acta Math. Hung. 103, 233\u2013241 (2004)","journal-title":"Acta Math. Hung."},{"key":"659_CR5","unstructured":"Censor, Y., Zenios, A.: Parallel Optimization, Oxford University Press, New York (1997)"},{"key":"659_CR6","volume-title":"Introduction to Optimization","author":"T Polyak","year":"1987","unstructured":"Polyak, T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"659_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01585107","volume":"24","author":"Y Censor","year":"1982","unstructured":"Censor, Y., Lent, A.: Cyclic subgradient projections. Math. Program. 24, 233\u2013235 (1982)","journal-title":"Math. Program."},{"key":"659_CR8","doi-asserted-by":"crossref","unstructured":"Censor, Y., Segal, A.: Sparse string-averaging and split common fixed points. In: Leizarowitz, A., Mordukhovich, B.S., Shafrir, I., Zaslavski, A.J. (eds) Nonlinear Analysis and Optimization. I. Contemporary Mathematics, vol. 513, pp. 125\u2013142. AMS, Haifa (2010)","DOI":"10.1090\/conm\/513\/10079"},{"key":"659_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/5.214546","volume":"81","author":"L Combettes","year":"1993","unstructured":"Combettes, L.: The foundations of set theoretic estimation. Proc. IEEE 81, 182\u2013208 (1993)","journal-title":"Proc. IEEE"},{"key":"659_CR10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/83.563316","volume":"6","author":"L Combettes","year":"1997","unstructured":"Combettes, L.: Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Trans. Image Process. 6, 493\u2013506 (1997)","journal-title":"IEEE Trans. Image Process."},{"key":"659_CR11","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1109\/TIP.2002.804527","volume":"11","author":"PL Combettes","year":"2002","unstructured":"Combettes, P.L., Luo, J.: An adaptive level set method for nondifferentiable constrained image recovery. IEEE Trans. Image Process. 11, 1295\u20131304 (2002)","journal-title":"IEEE Trans. Image Process."},{"key":"659_CR12","unstructured":"Polyak, T.: Minimization of unsmooth functionals, USSR Comput. Math. Math. Phys. 9, 14\u201329 (1969) (The original version appeared in Akademija Nauk SSSR. \u017durnal Vy\u010dislitel\u2019 no\u012d Matematiki i Matemati\u010desko\u012d Fiziki 9 (1969), 509\u2013521.)"},{"key":"659_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1137\/100807004","volume":"23","author":"K Slavakis","year":"2013","unstructured":"Slavakis, K., Yamada, I.: The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning. SIAM J. Optim. 23, 126\u2013152 (2013)","journal-title":"SIAM J. Optim."},{"key":"659_CR14","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1081\/NFA-200045806","volume":"25","author":"I Yamada","year":"2004","unstructured":"Yamada, I., Ogura, N.: Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions. Numer. Funct. Anal. Optim. 25, 593\u2013617 (2004)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"659_CR15","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1081\/NFA-200045815","volume":"25","author":"I Yamada","year":"2004","unstructured":"Yamada, I., Ogura, N.: Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings. Numer. Funct. Anal. Optim. 25, 619\u2013655 (2004)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"659_CR16","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/78.995065","volume":"50","author":"I Yamada","year":"2002","unstructured":"Yamada, I., Slavakis, K., Yamada, K.: An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques. IEEE Trans. Signal Process. 50, 1091\u20131101 (2002)","journal-title":"IEEE Trans. Signal Process."},{"key":"659_CR17","doi-asserted-by":"crossref","unstructured":"Yamagishi, M., Yamada, I.: A deep monotone approximation operator based on the bestquadratic lower bound of convex functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E91-A, 1858\u20131866 (2008)","DOI":"10.1093\/ietfec\/e91-a.8.1858"},{"key":"659_CR18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"659_CR19","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","volume":"26","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Combettes, P.L.: A weak-to-strong convergence principlefor Fej\u00e9r-monotone methods in Hilbert space. Math. Oper. Res. 26, 248\u2013264 (2001)","journal-title":"Math. Oper. Res."},{"key":"659_CR20","unstructured":"Bauschke, H.H., Wang, C., Wang, X., Xu, J.: On subgradient projectors. http:\/\/arxiv.org\/abs\/1403.7135v1 (2014)"},{"key":"659_CR21","unstructured":"Pauwels, B.: Subgradient projection operators. http:\/\/arxiv.org\/abs\/1403.7237v1 (2014)"},{"key":"659_CR22","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"659_CR23","unstructured":"Bauschke, H.H.: Projection Algorithms and Monotone Operators. PhD thesis, Simon Fraser University, Burnaby, BC, Canada (1996)"},{"key":"659_CR24","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1023\/B:JOTA.0000025708.31430.22","volume":"120","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Kruk, G.: Reflection-projection method for convex feasibility problems with an obtuse cone. J. Optim. Theory Appl. 120, 503\u2013531 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"659_CR25","first-page":"22","volume":"18","author":"E Raik","year":"1969","unstructured":"Raik, E.: A class of iterative methods with Fej\u00e9r-monotone sequences, Eesti NSV Teaduste Akadeemia Toimetised. F\u00fc\u00fcsika-Matemaatika 18, 22\u201326 (1969)","journal-title":"F\u00fc\u00fcsika-Matemaatika"},{"key":"659_CR26","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"T Rockafellar","year":"1976","unstructured":"Rockafellar, T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"659_CR27","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1109\/TAC.1982.1103081","volume":"27","author":"M Fukushima","year":"1982","unstructured":"Fukushima, M.: A finite convergent algorithm for convex inequalities. IEEE Trans. Autom. Control 27, 1126\u20131127 (1982)","journal-title":"IEEE Trans. Autom. Control"},{"key":"659_CR28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01448368","volume":"17","author":"AR Pierro De","year":"1988","unstructured":"De Pierro, A.R., Iusem, A.N.: A finitely convergent \u201crow-action\u201d method for the convex feasibility problem. Appl. Math. Optim. 17, 225\u2013235 (1988)","journal-title":"Appl. Math. Optim."},{"key":"659_CR29","first-page":"169","volume":"5","author":"AN Iusem","year":"1986","unstructured":"Iusem, A.N., Moledo, L.: A finitely convergent method of simultaneous subgradient projections for the convex feasibility problem. Matem\u00e1tica Aplicada e Computacional 5, 169\u2013184 (1986)","journal-title":"Matem\u00e1tica Aplicada e Computacional"},{"key":"659_CR30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02584829","volume":"18","author":"AN Iusem","year":"1987","unstructured":"Iusem, A.N., Moledo, L.: On finitely convergent iterative methods for the convexfeasibility problem. Boletim da Sociedade Brasileira de Matem\u00e1tica 18, 11\u201318 (1987)","journal-title":"Boletim da Sociedade Brasileira de Matem\u00e1tica"},{"key":"659_CR31","unstructured":"Pang, J.: Finitely convergent algorithm for nonconvex inequality problems. http:\/\/arxiv.org\/abs\/1405.7280v1 (2014)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0659-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0659-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0659-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T22:06:34Z","timestamp":1565906794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0659-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,10]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["659"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0659-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,10]]}}}