{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:37Z","timestamp":1740142477223,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["258033"],"award-info":[{"award-number":["258033"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s40314-020-01184-w","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T17:02:45Z","timestamp":1590512565000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transportless conjugate gradient for optimization on Stiefel manifold"],"prefix":"10.1007","volume":"39","author":[{"given":"Edgar Fuentes","family":"Figueroa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1828-8458","authenticated-orcid":false,"given":"Oscar","family":"Dalmau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"issue":"9","key":"1184_CR1","doi-asserted-by":"crossref","first-page":"1704","DOI":"10.1016\/j.sigpro.2009.03.015","volume":"89","author":"T Abrudan","year":"2009","unstructured":"Abrudan T, Eriksson J, Koivunen V (2009) Conjugate gradient algorithm for optimization under unitary matrix constraint. Sig Process 89(9):1704\u20131714","journal-title":"Sig Process"},{"issue":"3","key":"1184_CR2","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1109\/TSP.2007.908999","volume":"56","author":"TE Abrudan","year":"2008","unstructured":"Abrudan TE, Eriksson J, Koivunen V (2008) Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Trans Signal Process 56(3):1134\u20131147","journal-title":"IEEE Trans Signal Process"},{"issue":"3","key":"1184_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil PA, Baker CG, Gallivan KA (2007) Trust-region methods on riemannian manifolds. Found Comput Math 7(3):303\u2013330","journal-title":"Found Comput Math"},{"key":"1184_CR4","volume-title":"Optimization algorithms on matrix manifolds","author":"PA Absil","year":"2009","unstructured":"Absil PA, Mahony R, Sepulchre R (2009) Optimization algorithms on matrix manifolds. Princeton University Press, Princeton"},{"issue":"4","key":"1184_CR5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1093\/imanum\/drn029","volume":"28","author":"CG Baker","year":"2008","unstructured":"Baker CG, Absil PA, Gallivan KA (2008) An implicit trust-region method on riemannian manifolds. IMA J Numer Anal 28(4):665\u2013689","journal-title":"IMA J Numer Anal"},{"issue":"1","key":"1184_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10898-004-0574-9","volume":"30","author":"J Balogh","year":"2004","unstructured":"Balogh J, Csendes T, Rapcs\u00e1k T (2004) Some global optimization problems on stiefel manifolds. J Global Optim 30(1):91\u2013101","journal-title":"J Global Optim"},{"issue":"2","key":"1184_CR7","first-page":"139","volume":"15","author":"Y Dai","year":"2002","unstructured":"Dai Y (2002) Nonmonotone conjugate gradient algorithm for unconstrained optimization. J Syst Sci Complexity 15(2):139\u2013145","journal-title":"J Syst Sci Complexity"},{"key":"1184_CR8","unstructured":"Dalmau O, Leon HFO (2017) Projected nonmonotone search methods for optimization with orthogonality constraints. Comput Appl Math pp 1\u201327"},{"issue":"4","key":"1184_CR9","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s002110050432","volume":"82","author":"L Eld\u00e9n","year":"1999","unstructured":"Eld\u00e9n L, Park H (1999) A procrustes problem on the stiefel manifold. Numer Math 82(4):599\u2013619","journal-title":"Numer Math"},{"key":"1184_CR10","volume-title":"Notes on matrix calculus","author":"PL Fackler","year":"2005","unstructured":"Fackler PL (2005) Notes on matrix calculus. North Carolina State University, North Carolina"},{"issue":"1","key":"1184_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5540\/tema.2014.015.01.0083","volume":"15","author":"J Francisco","year":"2014","unstructured":"Francisco J, Martini T (2014) Spectral projected gradient method for the procrustes problem. TEMA (S\u00e3o Carlos) 15(1):83\u201396","journal-title":"TEMA (S\u00e3o Carlos)"},{"key":"1184_CR12","unstructured":"Golub GH, van Loan CF (2013) Matrix Computations, 4th edn. JHU Press. URL http:\/\/www.cs.cornell.edu\/cv\/GVL4\/golubandvanloan.htm"},{"key":"1184_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198510581.001.0001","volume-title":"Procrustes problems","author":"JC Gower","year":"2004","unstructured":"Gower JC, Dijksterhuis GB (2004) Procrustes problems, vol 30. Oxford University Press on Demand, Oxford"},{"issue":"2\u20133","key":"1184_CR14","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.laa.2006.11.024","volume":"422","author":"I Grubi\u0161i\u0107","year":"2007","unstructured":"Grubi\u0161i\u0107 I, Pietersz R (2007) Efficient rank reduction of correlation matrices. Linear Algebra Appl 422(2\u20133):629\u2013653","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"1184_CR15","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00211-016-0848-4","volume":"136","author":"W Huang","year":"2017","unstructured":"Huang W, Absil PA, Gallivan KA (2017) Intrinsic representation of tangent vectors and vector transports on matrix manifolds. Numer Math 136(2):523\u2013543","journal-title":"Numer Math"},{"issue":"3","key":"1184_CR16","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1137\/140955483","volume":"25","author":"W Huang","year":"2015","unstructured":"Huang W, Gallivan KA, Absil PA (2015) A broyden class of quasi-newton methods for riemannian optimization. SIAM J Optim 25(3):1660\u20131685","journal-title":"SIAM J Optim"},{"key":"1184_CR17","doi-asserted-by":"crossref","unstructured":"Joho M, Mathis H (2002) Joint diagonalization of correlation matrices by using gradient methods with application to blind signal separation. In: Sensor array and multichannel signal processing workshop proceedings, IEEE, pp 273\u2013277","DOI":"10.1109\/SAM.2002.1191043"},{"issue":"4","key":"1184_CR18","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1137\/090771181","volume":"21","author":"Q Li","year":"2011","unstructured":"Li Q, Qi H (2011) A sequential semismooth newton method for the nearest low-rank correlation matrix problem. SIAM J Optim 21(4):1641\u20131666","journal-title":"SIAM J Optim"},{"issue":"4","key":"1184_CR19","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1137\/140957962","volume":"53","author":"X Liu","year":"2015","unstructured":"Liu X, Wen Z, Wang X, Ulbrich M, Yuan Y (2015) On the analysis of the discretized kohn-sham density functional theory. SIAM J Numer Anal 53(4):1758\u20131785","journal-title":"SIAM J Numer Anal"},{"issue":"3","key":"1184_CR20","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1109\/78.984753","volume":"50","author":"JH Manton","year":"2002","unstructured":"Manton JH (2002) Optimization algorithms exploiting unitary constraints. IEEE Trans Signal Process 50(3):635\u2013650","journal-title":"IEEE Trans Signal Process"},{"key":"1184_CR21","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov Y (1983) A method for solving the convex programming problem with convergence rate O$$(1\/k^2)$$. Sov Math Doklady 27:372\u2013376","journal-title":"Sov Math Doklady"},{"key":"1184_CR22","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.neucom.2004.11.035","volume":"67","author":"Y Nishimori","year":"2005","unstructured":"Nishimori Y, Akaho S (2005) Learning algorithms utilizing quasi-geodesic flows on the stiefel manifold. Neurocomputing 67:106\u2013135","journal-title":"Neurocomputing"},{"key":"1184_CR23","volume-title":"Numerical optimization. Springer series in operations research and financial engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer series in operations research and financial engineering, 2nd edn. Springer, New York","edition":"2"},{"key":"1184_CR24","doi-asserted-by":"crossref","unstructured":"Pietersz R, Groenen PJ (2004) Rank reduction of correlation matrices by majorization. Quant Financ 4(6), 649\u2013662","DOI":"10.1080\/14697680400016182"},{"issue":"2","key":"1184_CR25","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/11082885X","volume":"22","author":"W Ring","year":"2012","unstructured":"Ring W, Wirth B (2012) Optimization methods on riemannian manifolds and their application to shape space. SIAM J Optim 22(2):596\u2013627","journal-title":"SIAM J Optim"},{"key":"1184_CR26","volume-title":"Numerical methods for large eigenvalue problems","author":"Y Saad","year":"1992","unstructured":"Saad Y (1992) Numerical methods for large eigenvalue problems. Manchester University Press, Manchester"},{"issue":"4","key":"1184_CR27","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H Sato","year":"2015","unstructured":"Sato H, Iwai T (2015) A new, globally convergent riemannian conjugate gradient method. Optimization 64(4):1011\u20131031","journal-title":"Optimization"},{"issue":"6","key":"1184_CR28","doi-asserted-by":"crossref","first-page":"3352","DOI":"10.1137\/090763172","volume":"32","author":"B Savas","year":"2010","unstructured":"Savas B, Lim LH (2010) Quasi-newton methods on grassmannians and multilinear approximations of tensors. SIAM J Sci Comput 32(6):3352\u20133393","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"1184_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02289451","volume":"31","author":"PH Sch\u00f6nemann","year":"1966","unstructured":"Sch\u00f6nemann PH (1966) A generalized solution of the orthogonal procrustes problem. Psychometrika 31(1):1\u201310","journal-title":"Psychometrika"},{"key":"1184_CR30","doi-asserted-by":"crossref","unstructured":"Theis FJ, Cason TP, Absil PA (2009) Soft dimension reduction for ica by joint diagonalization on the stiefel manifold. In: International conference on independent component analysis and signal separation, Springer, New York, pp 354\u2013361","DOI":"10.1007\/978-3-642-00599-2_45"},{"issue":"3","key":"1184_CR31","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1007\/s10915-015-0061-0","volume":"66","author":"Z Wen","year":"2016","unstructured":"Wen Z, Yang C, Liu X, Zhang Y (2016) Trace-penalty minimization for large-scale eigenspace computation. J Sci Comput 66(3):1175\u20131203","journal-title":"J Sci Comput"},{"issue":"1\u20132","key":"1184_CR32","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen Z, Yin W (2013) A feasible method for optimization with orthogonality constraints. Math Program 142(1\u20132):397\u2013434","journal-title":"Math Program"},{"issue":"2","key":"1184_CR33","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1499096.1499099","volume":"36","author":"C Yang","year":"2009","unstructured":"Yang C, Meza JC, Lee B, Wang LW (2009) Kssolv\u2013a matlab toolbox for solving the kohn-sham equations. ACM Trans Math Softw (TOMS) 36(2):10","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"5","key":"1184_CR34","doi-asserted-by":"crossref","first-page":"1854","DOI":"10.1137\/060661442","volume":"29","author":"C Yang","year":"2007","unstructured":"Yang C, Meza JC, Wang LW (2007) A trust region direct constrained minimization algorithm for the kohn-sham equation. SIAM J Sci Comput 29(5):1854\u20131875","journal-title":"SIAM J Sci Comput"},{"issue":"4","key":"1184_CR35","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s11075-014-9924-y","volume":"69","author":"X Zhu","year":"2015","unstructured":"Zhu X (2015) A feasible filter method for the nearest low-rank correlation matrix problem. Numer Algorithm 69(4):763\u2013784","journal-title":"Numer Algorithm"},{"issue":"1","key":"1184_CR36","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10589-016-9883-4","volume":"67","author":"X Zhu","year":"2017","unstructured":"Zhu X (2017) A riemannian conjugate gradient method for optimization on the stiefel manifold. Comput Optim Appl 67(1):73\u2013110","journal-title":"Comput Optim Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01184-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01184-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01184-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T23:16:51Z","timestamp":1621984611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01184-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,26]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1184"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01184-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2020,5,26]]},"assertion":[{"value":"24 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"151"}}