{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:42:09Z","timestamp":1740123729473,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"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":["Numer Algor"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11075-021-01238-y","type":"journal-article","created":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T04:46:06Z","timestamp":1644295566000},"page":"1493-1517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Riemannian stochastic fixed point optimization algorithm"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9173-6723","authenticated-orcid":false,"given":"Hideaki","family":"Iiduka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,8]]},"reference":[{"key":"1238_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H. H., Borwein, J. M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1238_CR2","first-page":"129","volume":"15","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H. H., Chen, J.: A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition. J. Nonlinear Convex Anal. 15, 129\u2013135 (2014)","journal-title":"J. Nonlinear Convex Anal."},{"key":"1238_CR3","doi-asserted-by":"publisher","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 principle for Fej\u00e9r-monotone methods in Hilbert space. Math. Oper. Res. 26, 248\u2013264 (2001)","journal-title":"Math. Oper. Res."},{"key":"1238_CR4","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, New York (2017)","edition":"2nd edn."},{"key":"1238_CR5","unstructured":"B\u00e9cigneul, G., Ganea, O. E.: Riemannian adaptive optimization methods. Proc. Int. Conf. Learn. Represent., 1\u201316 (2019)"},{"key":"1238_CR6","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s10957-011-9921-4","volume":"152","author":"GC Bento","year":"2012","unstructured":"Bento, G. C., Melo, J. G.: Subgradient method for convex feasibility on Riemannian manifolds. J. Optim. Theory Appl. 152, 773\u2013785 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"1238_CR7","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1109\/TAC.2013.2254619","volume":"58","author":"S Bonnabel","year":"2013","unstructured":"Bonnabel, S.: Stochastic gradient descent on Riemannian manifolds. IEEE Trans. Autom. Control 58, 2217\u20132229 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1238_CR8","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.jmaa.2005.08.006","volume":"320","author":"P Chaoha","year":"2006","unstructured":"Chaoha, P., Phon-on, A: A note on fixed point sets in CAT(0) spaces. J. Math. Anal. Appl. 320, 983\u2013987 (2006)","journal-title":"J. Math. Anal. Appl."},{"key":"1238_CR9","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1109\/78.782189","volume":"47","author":"PL Combettes","year":"1999","unstructured":"Combettes, P. L., Bondon, P.: Hard-constrained inconsistent signal feasibility problems. IEEE Trans. Signal Process. 47, 2460\u20132468 (1999)","journal-title":"IEEE Trans. Signal Process."},{"key":"1238_CR10","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1238_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/02331930290019413","volume":"51","author":"O Ferreira","year":"2002","unstructured":"Ferreira, O., Oliveira, P. R.: Proximal point algorithm on Riemannian manifolds. Optimization 51, 257\u2013270 (2002)","journal-title":"Optimization"},{"key":"1238_CR12","volume-title":"Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings","author":"K Goebel","year":"1984","unstructured":"Goebel, K., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Dekker, New York and Basel (1984)"},{"key":"1238_CR13","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016)"},{"key":"1238_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10444-015-9426-z","volume":"42","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S: \u03b5-subgradient algorithms for locally lipschitz functions on Riemannian manifolds. Adv. Comput. Math. 42, 333\u2013360 (2016)","journal-title":"Adv. Comput. Math."},{"key":"1238_CR15","doi-asserted-by":"publisher","first-page":"2138","DOI":"10.1109\/TIP.2013.2246175","volume":"22","author":"S Hawe","year":"2013","unstructured":"Hawe, S., Kleinsteuber, M., Diepold, K.: Analysis operator learning and its application to image reconstruction. IEEE Trans. Image Process. 22, 2138\u20132150 (2013)","journal-title":"IEEE Trans. Image Process."},{"key":"1238_CR16","doi-asserted-by":"publisher","first-page":"4370","DOI":"10.1109\/TCYB.2019.2921369","volume":"50","author":"H Iiduka","year":"2020","unstructured":"Iiduka, H.: Stochastic fixed point optimization algorithm for classifier ensemble. IEEE Trans. Cybern. 50, 4370\u20134380 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"1238_CR17","unstructured":"Kasai, H., Jawanpuria, P., Mishra, B.: Riemannian adaptive stochastic gradient algorithms on matrix manifolds. Int. Conf. Mach. Learn., 3262\u20133271 (2019)"},{"key":"1238_CR18","unstructured":"Kingma, D. P., Ba, J. L.: Adam: a method for stochastic optimization. Proc. Int. Conf. Learn. Represent., 1\u201315 (2015)"},{"key":"1238_CR19","unstructured":"Kirk, W. A.: Geodesic geometry and fixed point theory II. In: Proceedings of the International Conference in Fixed Point Theory and Applications, pp. 113\u2013142, Valencia (2003)"},{"key":"1238_CR20","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1112\/jlms\/jdn087","volume":"79","author":"C Li","year":"2009","unstructured":"Li, C., L\u00f3pez, G., Mart\u00edn-M\u00e1rquez, V.: Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc. 79, 663\u2013683 (2009)","journal-title":"J. Lond. Math. Soc."},{"key":"1238_CR21","first-page":"541","volume":"14","author":"C Li","year":"2010","unstructured":"Li, C., L\u00f3pez, G., Mart\u00edn-M\u00e1rquez, V.: Iterative algorithms for nonexpansive mappings on Hadamard manifolds. Taiwan. J. Math. 14, 541\u2013559 (2010)","journal-title":"Taiwan. J. Math."},{"key":"1238_CR22","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s11228-010-0169-1","volume":"19","author":"C Li","year":"2011","unstructured":"Li, C., L\u00f3pez, G., Mart\u00edn-M\u00e1rquez, V., Wang, J. H.: Resolvents of set-valued monotone vector fields in Hadamard manifolds. Set-Valued Anal. 19, 361\u2013383 (2011)","journal-title":"Set-Valued Anal."},{"key":"1238_CR23","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1016\/j.na.2009.04.048","volume":"71","author":"SL Li","year":"2009","unstructured":"Li, S. L., Li, C., Liou, Y. C., Yao, J. C.: Existence of solutions for variational inequalities on Riemannian manifolds. Nonlinear Anal. Theory Methods Appl. 71, 5695\u20135706 (2009)","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"key":"1238_CR24","first-page":"4868","volume":"30","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Shang, F., Cheng, J., Cheng, H., Jiao, L.: Accelerated first-order methods for geodesically convex optimization on Riemannian manifolds. Adv. Neural Inf. Process. Syst. 30, 4868\u20134877 (2017)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1238_CR25","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1238_CR26","first-page":"6338","volume":"30","author":"M Nickel","year":"2017","unstructured":"Nickel, M., Kiela, D.: Poincar\u00e9 embeddings for learning hierarchical representations. Adv. Neural Inf. Process. Syst. 30, 6338\u20136347 (2017)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1238_CR27","unstructured":"Reddi, S. J., Kale, S., Kumar, S.: On the convergence of Adam and beyond. Proc. Int. Conf. Learn. Represent., 1\u201323 (2018)"},{"key":"1238_CR28","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/11082885X","volume":"22","author":"W Ring","year":"2012","unstructured":"Ring, W., Wirth, B.: Optimization methods on Riemannian manifolds and their application to shape space. SIAM J. Optim. 22, 596\u2013627 (2012)","journal-title":"SIAM J. Optim."},{"key":"1238_CR29","doi-asserted-by":"crossref","unstructured":"Sakai, H., Iiduka, H.: Riemannian adaptive optimization algorithm and its application to natural language processing. IEEE Trans. Cybern. (2021)","DOI":"10.1109\/TCYB.2021.3049845"},{"key":"1238_CR30","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/149","volume-title":"Riemannian Geometry. Translations of Mathematical Monographs","author":"T Sakai","year":"1996","unstructured":"Sakai, T.: Riemannian Geometry. Translations of Mathematical Monographs. American Marhmarical Society, Providence (1996)"},{"key":"1238_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10589-015-9801-1","volume":"64","author":"H Sato","year":"2016","unstructured":"Sato, H.: A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions. Comput. Optim. Appl. 64, 101\u2013118 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1238_CR32","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H Sato","year":"2015","unstructured":"Sato, H., Iwai, T.: A new, globally convergent Riemannian conjugate gradient method. Optimization 64, 1011\u20131031 (2015)","journal-title":"Optimization"},{"key":"1238_CR33","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1137\/17M1116787","volume":"29","author":"H Sato","year":"2019","unstructured":"Sato, H., Kasai, H., Mishra, B.: Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport. SIAM J. Optim. 29, 1444\u20131472 (2019)","journal-title":"SIAM J. Optim."},{"key":"1238_CR34","first-page":"26","volume":"4","author":"T Tieleman","year":"2012","unstructured":"Tieleman, T., Hinton, G.: Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude. COURSERA: Neural Netw. Mach. Learn. 4, 26\u201331 (2012)","journal-title":"COURSERA: Neural Netw. Mach. Learn."},{"key":"1238_CR35","doi-asserted-by":"publisher","DOI":"10.1515\/9783110900118","volume-title":"Ill-Posed Problems with a Priori Information","author":"VV Vasin","year":"1995","unstructured":"Vasin, V. V., Ageev, A. L.: Ill-Posed Problems with a Priori Information. V.S.P Intl Science, Utrecht (1995)"},{"key":"1238_CR36","doi-asserted-by":"publisher","first-page":"2334","DOI":"10.1137\/14099961X","volume":"25","author":"X Wang","year":"2015","unstructured":"Wang, X., Li, C., Wang, J., Yao, J. H.: Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifolds. SIAM J. Optim. 25, 2334\u20132358 (2015)","journal-title":"SIAM J. Optim."},{"key":"1238_CR37","doi-asserted-by":"crossref","unstructured":"Yamada, I.: The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms for Feasibility and Optimization and Their Applications, pp 473\u2013504. Elsevier, New York (2001)","DOI":"10.1016\/S1570-579X(01)80028-8"},{"key":"1238_CR38","first-page":"1","volume":"49","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Sra, S.: First-order methods for geodesically convex optimization. J. Mach. Learn. Res. 49, 1\u201322 (2016)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01238-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01238-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01238-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T07:16:44Z","timestamp":1657869404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01238-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,8]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1238"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01238-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,2,8]]},"assertion":[{"value":"1 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2022","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}