{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:06Z","timestamp":1740122766846,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10589-021-00324-0","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T07:02:49Z","timestamp":1635836569000},"page":"289-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding best approximation pairs for two intersections of closed convex sets"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4155-9930","authenticated-orcid":false,"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shambhavi","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianfu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"324_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10589-018-0021-3","volume":"71","author":"R Aharoni","year":"2018","unstructured":"Aharoni, R., Censor, Y., Jiang, Z.: Finding a best approximation pair of points for two polyhedra. Comput. Optim. Appl. 71, 509\u2013523 (2018). https:\/\/doi.org\/10.1007\/s10589-018-0021-3","journal-title":"Comput. Optim. Appl."},{"key":"324_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1006\/jmaa.1996.0308","volume":"202","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H.: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space. J. Math. Anal. Appl. 202, 150\u2013159 (1996). https:\/\/doi.org\/10.1006\/jmaa.1996.0308","journal-title":"J. Math. Anal. Appl."},{"key":"324_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01027691","volume":"1","author":"HH Bauschke","year":"1993","unstructured":"Bauschke, H.H., Borwein, J.M.: On the convergence of von Neumann\u2019s alternating projection algorithm for two sets. Set-Valued Anal. 1, 185\u2013212 (1993). https:\/\/doi.org\/10.1007\/BF01027691","journal-title":"Set-Valued Anal."},{"key":"324_CR4","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jath.1994.1136","volume":"79","author":"HH Bauschke","year":"1994","unstructured":"Bauschke, H.H., Borwein, J.M.: Dykstra\u2019s alternating projection algorithm for two sets. J. Approx. Theory 79, 418\u2013443 (1994). https:\/\/doi.org\/10.1006\/jath.1994.1136","journal-title":"J. Approx. Theory"},{"key":"324_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","edition":"2"},{"key":"324_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","volume":"127","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Combettes, P.L., Luke, D.R.: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theory 127, 178\u2013192 (2004). https:\/\/doi.org\/10.1016\/j.jat.2004.02.006","journal-title":"J. Approx. Theory"},{"key":"324_CR7","doi-asserted-by":"publisher","first-page":"2559","DOI":"10.1137\/19M1281538","volume":"30","author":"HH Bauschke","year":"2020","unstructured":"Bauschke, H.H., Moursi, W.M.: On the behavior of the Douglas\u2013Rachford algorithm for minimizing a convex function subject to a linear constraint. SIAM J. Optim. 30, 2559\u20132576 (2020). https:\/\/doi.org\/10.1137\/19M1281538","journal-title":"SIAM J. Optim."},{"key":"324_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, University City (2017). https:\/\/doi.org\/10.1137\/1.9781611974997"},{"key":"324_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2013.10.007","volume":"42","author":"A Beck","year":"2014","unstructured":"Beck, A., Teboulle, M.: A fast dual proximal-gradient algorithm for convex minimization and applications. Oper. Res. Lett. 42, 1\u20136 (2014). https:\/\/doi.org\/10.1016\/j.orl.2013.10.007","journal-title":"Oper. Res. Lett."},{"key":"324_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018). https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Rev."},{"key":"324_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.laa.2005.10.006","volume":"416","author":"Y Censor","year":"2006","unstructured":"Censor, Y.: Computational acceleration of projection algorithms for the linear best approximation problem. Linear Algebra Appl. 416, 111\u2013123 (2006). https:\/\/doi.org\/10.1016\/j.laa.2005.10.006","journal-title":"Linear Algebra Appl."},{"key":"324_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.2307\/2032864","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A.A.: Proximity maps for convex sets. Proc. AMS 10, 448\u2013450 (1959). https:\/\/doi.org\/10.2307\/2032864","journal-title":"Proc. AMS"},{"key":"324_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s11228-010-0147-7","volume":"18","author":"PL Combettes","year":"2010","unstructured":"Combettes, P.L., D\u0169ng, \u0110, V\u0169, B.C.: Dualization of signal recovery problems. Set-Valued Var. Anal. 18, 373\u2013404 (2010). https:\/\/doi.org\/10.1007\/s11228-010-0147-7","journal-title":"Set-Valued Var. Anal."},{"key":"324_CR14","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. AMS 82, 421\u2013439 (1956). https:\/\/doi.org\/10.1090\/S0002-9947-1956-0084194-4","journal-title":"Trans. AMS"},{"key":"324_CR15","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0002-9904-1967-11864-0","volume":"73","author":"B Halpern","year":"1967","unstructured":"Halpern, B.: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73, 957\u2013961 (1967). https:\/\/doi.org\/10.1090\/S0002-9904-1967-11864-0","journal-title":"Bull. Am. Math. Soc."},{"key":"324_CR16","first-page":"1","volume":"20","author":"KL Keys","year":"2019","unstructured":"Keys, K.L., Zhou, H., Lange, K.: Proximal distance algorithms: theory and practice. J. Mach. Learn. Res. 20, 1\u201338 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"324_CR17","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23(3), 462\u2013466 (1952). https:\/\/doi.org\/10.1214\/aoms\/1177729392","journal-title":"Ann. Math. Stat."},{"key":"324_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409","volume-title":"MM Optimization Algorithms","author":"K Lange","year":"2016","unstructured":"Lange, K.: MM Optimization Algorithms. SIAM, University City (2016). https:\/\/doi.org\/10.1137\/1.9781611974409"},{"key":"324_CR19","unstructured":"Lange, K., Keys, K.L.: The proximal distance algorithm. In: Proceedings of the 2014 International Congress of Mathematicians, pp.\u00a096\u2013116. Seoul: Kyung Moon, 4. See also https:\/\/arxiv.org\/abs\/1507.07598"},{"key":"324_CR20","unstructured":"Lions, P.-L.: Approximation de points fixes de contractions. Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences S\u00e9ries A (Sciences Math\u00e9matiques)) et B (Sciences Physiques) 284(21), 1357\u20131359 (June 6, 1977). https:\/\/gallica.bnf.fr\/ark:\/12148\/bpt6k5731057m"},{"key":"324_CR21","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L Lions","year":"1979","unstructured":"Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979). https:\/\/doi.org\/10.1137\/0716071","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"324_CR22","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951). https:\/\/doi.org\/10.1214\/aoms\/1177729586","journal-title":"Ann. Math. Stat."},{"key":"324_CR23","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BF01190119","volume":"58","author":"R Wittmann","year":"1992","unstructured":"Wittmann, R.: Approximation of fixed points of nonexpansive mappings. Arch. Math. 58, 486\u2013491 (1992). https:\/\/doi.org\/10.1007\/BF01190119","journal-title":"Arch. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00324-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00324-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00324-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T18:29:55Z","timestamp":1641407395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00324-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["324"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00324-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"25 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}