{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T05:21:57Z","timestamp":1739424117929,"version":"3.37.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T00:00:00Z","timestamp":1736121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T00:00:00Z","timestamp":1736121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23K19981","24K20845"],"award-info":[{"award-number":["23K19981","24K20845"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10957-024-02580-6","type":"journal-article","created":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:54:27Z","timestamp":1736142867000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Global Convergence and Acceleration of Projection Methods for Feasibility Problems Involving Union Convex Sets"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7242-4414","authenticated-orcid":false,"given":"Jan Harold","family":"Alcantara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-pei","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,6]]},"reference":[{"issue":"39","key":"2580_CR1","first-page":"1","volume":"25","author":"JH Alcantara","year":"2023","unstructured":"Alcantara, J.H., Chen, J.S., Tam, M.K.: Method of alternating projections for the general absolute value equation. J. Fixed Point Theory Appl. 25(39), 1\u201338 (2023)","journal-title":"J. Fixed Point Theory Appl."},{"issue":"1","key":"2580_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"2580_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4848-0","volume-title":"Set-Valued Analysis","author":"JP Aubin","year":"2009","unstructured":"Aubin, J.P., Frankowska, H.: Set-Valued Analysis. Birkh\u00e4user Basel, Basel (2009)"},{"key":"2580_CR4","doi-asserted-by":"crossref","unstructured":"Auslender, A.: M\u00e9thodes num\u00e9riques pour la r\u00e9solution des probl\u00e8mes d\u2019optimisation avec contraintes. PhD thesis, Uni. Grenoble (1969)","DOI":"10.1051\/m2an\/196903R200271"},{"key":"2580_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1023\/B:JOTA.0000025708.31430.22","volume":"120","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Kruk, S.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":"2580_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10013-013-0049-8","volume":"42","author":"HH Bauschke","year":"2013","unstructured":"Bauschke, H.H., Phan, H.M., Wang, X.: The method of alternating relaxed projections for two nonconvex sets. Vietnam J. Math. 42, 421\u2013450 (2013)","journal-title":"Vietnam J. Math."},{"key":"2580_CR7","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 - Society for Industrial and Applied Mathematics, Philadelphia (2017)"},{"key":"2580_CR8","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-1-4419-9569-8_3","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"A Beck","year":"2011","unstructured":"Beck, A., Teboulle, M.: A linearly convergent algorithm for solving a class of nonconvex\/affine feasibility problems. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications, vol. 49, pp. 33\u201348. Springer, New York (2011)"},{"issue":"1","key":"2580_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2011","unstructured":"Becker, S., Bobin, J., Cand\u00e8s, E.J.: Nesta: a fast and accurate first-order method for sparse recovery. SIAM J. Image Sci. 4(1), 1\u201339 (2011)","journal-title":"SIAM J. Image Sci."},{"key":"2580_CR10","first-page":"688","volume":"6","author":"LM Br\u00e8gman","year":"1965","unstructured":"Br\u00e8gman, L.M.: The method of successive projection for finding a common point of convex sets. Soviet Math. Doklady 6, 688\u2013692 (1965)","journal-title":"Soviet Math. Doklady"},{"key":"2580_CR11","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2580_CR12","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)"},{"key":"2580_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10957-018-1443-x","volume":"181","author":"MN Dao","year":"2019","unstructured":"Dao, M.N., Tam, M.K.: Union averaged operators with applications to proximal algorithms for min-convex functions. J. Optim. Theory Appl. 181, 61\u201394 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"2580_CR14","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10013-019-00357-3","volume":"47","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Local linear convergence for inexact alternating projections on nonconvex sets. Vietnam J. Math. 47, 669\u2013681 (2019)","journal-title":"Vietnam J. Math."},{"key":"2580_CR15","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. Springer, New York (2003)"},{"key":"2580_CR16","doi-asserted-by":"publisher","first-page":"4868","DOI":"10.1109\/TSP.2014.2339801","volume":"62","author":"R Hesse","year":"2014","unstructured":"Hesse, R., Luke, D.R., Neumann, P.: Alternating projections and Douglas\u2013Rachford for sparse affine feasibility. IEEE Trans Signal Process. 62, 4868\u20134881 (2014)","journal-title":"IEEE Trans Signal Process."},{"issue":"4","key":"2580_CR17","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1137\/S0895479894273134","volume":"17","author":"C Kanzow","year":"1996","unstructured":"Kanzow, C.: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17(4), 851\u2013868 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2580_CR18","doi-asserted-by":"crossref","unstructured":"Lee, C.P.: Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification. Math. Program. (2023)","DOI":"10.1007\/s10107-022-01916-2"},{"key":"2580_CR19","first-page":"1705","volume":"13","author":"S Lee","year":"2012","unstructured":"Lee, S., Wright, S.J.: Manifold identification in dual averaging for regularized stochastic online learning. J. Mach. Learn. Res. 13, 1705\u20131744 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"2580_CR20","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"AS Lewis","year":"2009","unstructured":"Lewis, A.S., Luke, D.R., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9, 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"key":"2580_CR21","unstructured":"Li, Y.S., Chiang, W.L., Lee C.P.: Manifold identification for ultimately communication-efficient distributed optimization. In: Proceedings of the 37th International Conference on Machine Learning (2020)"},{"key":"2580_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10589-022-00357-z","volume":"82","author":"T Liu","year":"2022","unstructured":"Liu, T., Takeda, A.: An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems. Comput. Optim. Appl. 82, 141\u2013173 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"2580_CR23","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"2580_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s101079900127","volume":"87","author":"L Qi","year":"2000","unstructured":"Qi, L., Sun, D., Zhou, G.: A new look at smoothing Newton method for nonlinear complementarity problems and box constrained complementarity problems. Math. Program. 87, 1\u201335 (2000)","journal-title":"Math. Program."},{"key":"2580_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis, Grundlehren der MathematischenWissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, Grundlehren der MathematischenWissenschaften, vol. 317. Springer, Berlin (1998)"},{"issue":"5","key":"2580_CR26","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s11590-018-1249-7","volume":"12","author":"MK Tam","year":"2018","unstructured":"Tam, M.K.: Algorithms based on union of nonexpansive maps. Optim. Lett. 12(5), 1019\u20131027 (2018)","journal-title":"Optim. Lett."},{"key":"2580_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69, 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02580-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02580-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02580-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T12:54:01Z","timestamp":1739364841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02580-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2580"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02580-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,1,6]]},"assertion":[{"value":"11 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}