{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:00:05Z","timestamp":1780084805413,"version":"3.54.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T00:00:00Z","timestamp":1599264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T00:00:00Z","timestamp":1599264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18K11184"],"award-info":[{"award-number":["JP18K11184"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10589-020-00224-9","type":"journal-article","created":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T10:02:31Z","timestamp":1599300151000},"page":"811-830","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Hybrid Riemannian conjugate gradient methods with global convergence properties"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7144-1549","authenticated-orcid":false,"given":"Hiroyuki","family":"Sakai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hideaki","family":"Iiduka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,5]]},"reference":[{"key":"224_CR1","doi-asserted-by":"crossref","unstructured":"Absil, P.-A., Gallivan, K.A.: Joint diagonalization on the oblique manifold for independent component analysis. In: 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, vol. 5, p. V (2006)","DOI":"10.1109\/ICASSP.2006.1661433"},{"key":"224_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"issue":"1","key":"224_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M Al-Baali","year":"1985","unstructured":"Al-Baali, M.: Descent property and global convergence of the Fletcher\u2013Reeves method with inexact line search. IMA J. Numer. Anal. 5(1), 121\u2013124 (1985)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"224_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y-H Dai","year":"1999","unstructured":"Dai, Y.-H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"224_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"Y-H Dai","year":"2001","unstructured":"Dai, Y.-H., Yuan, Y.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103(1\u20134), 33\u201347 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"224_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"224_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"1","key":"224_CR8","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"issue":"6","key":"224_CR9","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(6), 2138\u20132150 (2013)","journal-title":"IEEE Trans. Image Process."},{"key":"224_CR10","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044","volume-title":"Methods of Conjugate Gradients for Solving Linear Systems","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of Conjugate Gradients for Solving Linear Systems. NBS, Washington (1952)"},{"issue":"2","key":"224_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00939927","volume":"71","author":"Y Hu","year":"1991","unstructured":"Hu, Y., Storey, C.: Global convergence result for conjugate gradient methods. J. Optim. Theory Appl. 71(2), 399\u2013405 (1991)","journal-title":"J. Optim. Theory Appl."},{"key":"224_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"R1","key":"224_CR13","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. ESAIM Math. Model. Numer. Anal.-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 3(R1), 35\u201343 (1969)","journal-title":"ESAIM Math. Model. Numer. Anal.-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique"},{"issue":"2","key":"224_CR14","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(2), 596\u2013627 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"224_CR15","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\u2013Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions. Comput. Optim. Appl. 64(1), 101\u2013118 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"224_CR16","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(4), 1011\u20131031 (2015)","journal-title":"Optimization"},{"issue":"12","key":"224_CR17","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1109\/TNNLS.2012.2218060","volume":"23","author":"SE Selvan","year":"2012","unstructured":"Selvan, S.E., Amato, U., Gallivan, K.A., Qi, C., Carfora, M.F., Larobina, M., Alfano, B.: Descent algorithms on oblique manifold for source-adaptive ICA contrast. IEEE Trans. Neural Netw. Learn. Syst. 23(12), 1930\u20131947 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"3","key":"224_CR18","first-page":"113","volume":"3","author":"ST Smith","year":"1994","unstructured":"Smith, S.T.: Optimization techniques on Riemannian manifolds. Fields Inst. Commun. 3(3), 113\u2013135 (1994)","journal-title":"Fields Inst. Commun."},{"issue":"2","key":"224_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00939455","volume":"64","author":"D Touati-Ahmed","year":"1990","unstructured":"Touati-Ahmed, D., Storey, C.: Efficient hybrid conjugate gradient techniques. J. Optim. Theory Appl. 64(2), 379\u2013397 (1990)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"224_CR20","first-page":"4755","volume":"17","author":"J Townsend","year":"2016","unstructured":"Townsend, J., Koep, N., Weichwald, S.: Pymanopt: a python toolbox for optimization on manifolds using automatic differentiation. J. Mach. Learn. Res. 17(1), 4755\u20134759 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"224_CR21","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization. SIAM J. Optim. 23(2), 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"224_CR22","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11(2), 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"issue":"2","key":"224_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. II: some corrections. SIAM Rev. 13(2), 185\u2013188 (1971)","journal-title":"SIAM Rev."},{"issue":"2","key":"224_CR24","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s10915-019-00971-w","volume":"80","author":"H Yuan","year":"2019","unstructured":"Yuan, H., Gu, X., Lai, R., Wen, Z.: Global optimization with orthogonality constraints via stochastic diffusion on manifold. J. Sci. Comput. 80(2), 1139\u20131170 (2019)","journal-title":"J. Sci. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00224-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00224-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00224-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T06:46:01Z","timestamp":1723531561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00224-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,5]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["224"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00224-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,5]]},"assertion":[{"value":"4 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Python implementations of the methods used in the numerical experiments are available at.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}