{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T19:39:35Z","timestamp":1774381175560,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11590-021-01801-5","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:21:32Z","timestamp":1632777692000},"page":"1773-1797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Implicit steepest descent algorithm for optimization with orthogonality constraints"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-0881","authenticated-orcid":false,"given":"Harry","family":"Oviedo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"issue":"9","key":"1801_CR1","doi-asserted-by":"publisher","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.: Conjugate gradient algorithm for optimization under unitary matrix constraint. Signal Process. 89(9), 1704\u20131714 (2009)","journal-title":"Signal Process."},{"issue":"3","key":"1801_CR2","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1109\/TSP.2007.908999","volume":"56","author":"TE Abrudan","year":"2008","unstructured":"Abrudan, T.E., Eriksson, J., Koivunen, V.: Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Trans. Signal Process. 56(3), 1134\u20131147 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"1801_CR3","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, 5, pp. V\u2013V. IEEE (2006)","DOI":"10.1109\/ICASSP.2006.1661433"},{"key":"1801_CR4","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"issue":"4","key":"1801_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1093\/imanum\/drn029","volume":"28","author":"CG Baker","year":"2008","unstructured":"Baker, C.G., Absil, P.A., Gallivan, K.A.: An implicit trust-region method on riemannian manifolds. IMA J. Numer. Anal. 28(4), 665\u2013689 (2008)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"1801_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1801_CR7","doi-asserted-by":"crossref","unstructured":"Boufounos, P.T., Baraniuk, R.G.: 1-bit compressive sensing. In: 2008 42nd annual conference on information sciences and systems, pp. 16\u201321. IEEE (2008)","DOI":"10.1109\/CISS.2008.4558487"},{"key":"1801_CR8","first-page":"406","volume":"24","author":"N Boumal","year":"2011","unstructured":"Boumal, N., Absil, P.A.: Rtrmc: a riemannian trust-region method for low-rank matrix completion. Adv. Neural. Inf. Process. Syst. 24, 406\u2013414 (2011)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"1","key":"1801_CR9","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.A., Sepulchre, R.: Manopt, a matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15(1), 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"1801_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717 (2009)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1801_CR11","doi-asserted-by":"publisher","first-page":"3118","DOI":"10.1007\/s40314-017-0501-6","volume":"37","author":"OSD Cedeno","year":"2018","unstructured":"Cedeno, O.S.D., Leon, H.F.O.: Projected nonmonotone search methods for optimization with orthogonality constraints. Comput. Appl. Math. 37(3), 3118\u20133144 (2018)","journal-title":"Comput. Appl. Math."},{"key":"1801_CR12","doi-asserted-by":"crossref","unstructured":"Dalmau-Cede\u00f1o, O., Oviedo, H.: A projection method for optimization problems on the stiefel manifold. In: Mexican conference on pattern recognition, pp. 84\u201393. Springer (2017)","DOI":"10.1007\/978-3-319-59226-8_9"},{"issue":"1","key":"1801_CR13","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"1801_CR14","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":"1801_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1801_CR16","doi-asserted-by":"crossref","unstructured":"Eld\u00e9n, L.: Matrix methods in data mining and pattern recognition, 4 SIAM (2007)","DOI":"10.1137\/1.9780898718867"},{"key":"1801_CR17","doi-asserted-by":"crossref","unstructured":"Feng, X., Yu, W., Li, Y.: Faster matrix completion using randomized svd. In: 2018 IEEE 30th International conference on tools with artificial intelligence (ICTAI), pp. 608\u2013615. IEEE (2018)","DOI":"10.1109\/ICTAI.2018.00098"},{"issue":"1","key":"1801_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.5540\/tema.2014.015.01.0083","volume":"15","author":"J Francisco","year":"2014","unstructured":"Francisco, J., Martini, T.: Spectral projected gradient method for the procrustes problem. TEMA (S\u00e3o Carlos) 15(1), 83\u201396 (2014)","journal-title":"TEMA (S\u00e3o Carlos)"},{"issue":"3","key":"1801_CR19","doi-asserted-by":"publisher","first-page":"A1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao, B., Liu, X., Yuan, Y.X.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), A1949\u2013A1983 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"1801_CR20","doi-asserted-by":"crossref","unstructured":"Gao, B., Son, N.T., Absil, P.A., Stykel, T.: Riemannian optimization on the symplectic stiefel manifold. (2020) arXiv preprint arXiv:2006.15226","DOI":"10.1137\/20M1348522"},{"issue":"1","key":"1801_CR21","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/080726926","volume":"2","author":"D Goldfarb","year":"2009","unstructured":"Goldfarb, D., Wen, Z., Yin, W.: A curvilinear search method for p-harmonic flows on spheres. SIAM J. Imag. Sci. 2(1), 84\u2013109 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"1801_CR22","volume-title":"Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations","author":"E Hairer","year":"2006","unstructured":"Hairer, E., Lubich, C., Wanner, G.: Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations. Springer, Berlin (2006)"},{"issue":"2","key":"1801_CR23","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s40305-020-00295-9","volume":"8","author":"J Hu","year":"2020","unstructured":"Hu, J., Liu, X., Wen, Z.W., Yuan, Y.X.: A brief introduction to manifold optimization. J. Oper. Res. Soc. China 8(2), 199\u2013248 (2020)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"1801_CR24","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/imanum\/drx015","volume":"38","author":"B Iannazzo","year":"2017","unstructured":"Iannazzo, B., Porcelli, M.: The riemannian barzilai-borwein method with nonmonotone line search and the matrix geometric mean computation. IMA J. Numer. Anal. 38(1), 495\u2013517 (2017)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"1801_CR25","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","volume":"153","author":"B Jiang","year":"2015","unstructured":"Jiang, B., Dai, Y.H.: A framework of constraint preserving update schemes for optimization on stiefel manifold. Math. Program. 153(2), 535\u2013575 (2015)","journal-title":"Math. Program."},{"key":"1801_CR26","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1801_CR27","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1002\/nla.743","volume":"18","author":"E Kokiopoulou","year":"2011","unstructured":"Kokiopoulou, E., Chen, J., Saad, Y.: Trace optimization and eigenproblems in dimension reduction methods. Numer. Linear Algebra Appl. 18(3), 565\u2013602 (2011)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"2","key":"1801_CR28","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014)","journal-title":"J. Sci. Comput."},{"key":"1801_CR29","unstructured":"Lara, H., Oviedo, H., Jinyun, Y.: Matrix completion via a low rank factorization model and an augmented lagrangean succesive overrelaxation algorithm. Bull. Comput. Appl. Math. 2(2) (2014)"},{"key":"1801_CR30","doi-asserted-by":"crossref","unstructured":"Liu, Y.F., Dai, Y.H., Luo, Z.Q.: On the complexity of leakage interference minimization for interference alignment. In: 2011 IEEE 12th international workshop on signal processing advances in wireless communications, pp. 471\u2013475. IEEE (2011)","DOI":"10.1109\/SPAWC.2011.5990455"},{"issue":"3","key":"1801_CR31","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/78.984753","volume":"50","author":"JH Manton","year":"2002","unstructured":"Manton, J.H.: Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process. 50(3), 635\u2013650 (2002)","journal-title":"IEEE Trans. Signal Process."},{"key":"1801_CR32","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s11075-020-01001-9","volume":"87","author":"H Oviedo","year":"2020","unstructured":"Oviedo, H., Dalmau, O., Lara, H.: Two adaptive scaled gradient projection methods for stiefel manifold constrained optimization. Numer. Algorithms 87, 1107\u20131127 (2020). https:\/\/doi.org\/10.1007\/s11075-020-01001-9","journal-title":"Numer. Algorithms"},{"issue":"2","key":"1801_CR33","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1080\/10556788.2017.1415337","volume":"34","author":"H Oviedo","year":"2019","unstructured":"Oviedo, H., Lara, H., Dalmau, O.: A non-monotone linear search algorithm with mixed direction on stiefel manifold. Optim. Methods Softw. 34(2), 437\u2013457 (2019)","journal-title":"Optim. Methods Softw."},{"key":"1801_CR34","unstructured":"Oviedo, H., Urdaneta, H.L.: A riemannian conjugate gradient algorithm with implicit vector transport for optimization in the stiefel manifold. Tech. rep., Technical report. UFSC-Blumenau, CIMAT (2018)"},{"key":"1801_CR35","unstructured":"Oviedo, H.F.: A spectral gradient projection method for the positive semi-definite procrustes problem. arXiv preprint arXiv:1908.06497 (2019)"},{"issue":"6","key":"1801_CR36","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1080\/14697680400016182","volume":"4","author":"R Pietersz","year":"2004","unstructured":"Pietersz, R., Groenen, P.J.: Rank reduction of correlation matrices by majorization. Quant. Fin. 4(6), 649\u2013662 (2004)","journal-title":"Quant. Fin."},{"key":"1801_CR37","doi-asserted-by":"crossref","unstructured":"Ravindra, V., Nassar, H., Gleich, D.F., Grama, A.: Rigid graph alignment. In: International conference on complex networks and their applications, pp. 621\u2013632. Springer (2019)","DOI":"10.1007\/978-3-030-36687-2_52"},{"key":"1801_CR38","unstructured":"Sato, H.: Riemannian newton\u2019s method for joint diagonalization on the stiefel manifold with application to ica. (2014) arXiv preprint arXiv:1403.8064"},{"issue":"1","key":"1801_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289451","volume":"31","author":"PH Sch\u00f6nemann","year":"1966","unstructured":"Sch\u00f6nemann, P.H.: A generalized solution of the orthogonal procrustes problem. Psychometrika 31(1), 1\u201310 (1966)","journal-title":"Psychometrika"},{"issue":"3","key":"1801_CR40","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":"1","key":"1801_CR41","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01199559","volume":"8","author":"E Stiefel","year":"1935","unstructured":"Stiefel, E.: Richtungsfelder und fernparallelismus in n-dimensionalen mannigfaltigkeiten. Commentarii Mathematici Helvetici 8(1), 305\u2013353 (1935)","journal-title":"Commentarii Mathematici Helvetici"},{"key":"1801_CR42","doi-asserted-by":"crossref","unstructured":"Urdaneta, H.L., Leon, H.F.O.: Solving joint diagonalization problems via a riemannian conjugate gradient method in stiefel manifold. Proc. Ser. Brazil. Soc. Comput. Appl. Math. 6(2) (2018)","DOI":"10.5540\/03.2018.006.02.0327"},{"key":"1801_CR43","unstructured":"Viklands, T.: Algorithms for the weighted orthogonal procrustes problem and other least squares problems. Ph.D. thesis, Datavetenskap (2006)"},{"issue":"3","key":"1801_CR44","doi-asserted-by":"publisher","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.: Trace-penalty minimization for large-scale eigenspace computation. J. Sci. Comput. 66(3), 1175\u20131203 (2016)","journal-title":"J. Sci. Comput."},{"issue":"1\u20132","key":"1801_CR45","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142(1\u20132), 397\u2013434 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"1801_CR46","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"key":"1801_CR47","doi-asserted-by":"crossref","unstructured":"Yu, Y., Fang, C., Liao, Z.: Piecewise flat embedding for image segmentation. In: Proceedings of the IEEE international conference on computer vision, pp. 1368\u20131376 (2015)","DOI":"10.1109\/ICCV.2015.161"},{"issue":"4","key":"1801_CR48","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1801_CR49","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1137\/140967994","volume":"36","author":"Z Zhao","year":"2015","unstructured":"Zhao, Z., Bai, Z.J., Jin, X.Q.: A riemannian newton algorithm for nonlinear eigenvalue problems. SIAM J. Matrix Anal. Appl. 36(2), 752\u2013774 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1801_CR50","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10589-016-9883-4","volume":"67","author":"X Zhu","year":"2017","unstructured":"Zhu, X.: A riemannian conjugate gradient method for optimization on the stiefel manifold. Comput. Optim. Appl. 67(1), 73\u2013110 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1801_CR51","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01801-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01801-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01801-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:35:55Z","timestamp":1725831355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01801-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1801"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01801-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"4 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}