{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T05:49:37Z","timestamp":1776836977135,"version":"3.51.2"},"reference-count":49,"publisher":"American Mathematical Society (AMS)","issue":"343","license":[{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>This paper mainly studies the gradient-based Jacobi-type algorithms to maximize two classes of homogeneous polynomials with orthogonality constraints, and establish their convergence properties. For the first class of homogeneous polynomials subject to a constraint on a Stiefel manifold, we reformulate it as an optimization problem on a unitary group, which makes it possible to apply the gradient-based Jacobi-type (Jacobi-G) algorithm. Then, if the subproblem can always be represented as a quadratic form, we establish the global convergence of Jacobi-G under any one of three conditions. The convergence result for the first condition is an easy extension of the result by Usevich, Li, and Comon [SIAM J. Optim. 30 (2020), pp.\u00a02998\u20133028], while other two conditions are new ones. This algorithm and the convergence properties apply to the well-known joint approximate symmetric tensor diagonalization. For the second class of homogeneous polynomials subject to constraints on the product of Stiefel manifolds, we reformulate it as an optimization problem on the product of unitary groups, and then develop a new gradient-based multiblock Jacobi-type (Jacobi-MG) algorithm to solve it. We establish the global convergence of Jacobi-MG under any one of the above three conditions, if the subproblem can always be represented as a quadratic form. This algorithm and the convergence properties are suitable to the well-known joint approximate tensor diagonalization. As the proximal variants of Jacobi-G and Jacobi-MG, we also propose the Jacobi-GP and Jacobi-MGP algorithms, and establish their global convergence without any further condition. Some numerical results are provided indicating the efficiency of the proposed algorithms.<\/p>","DOI":"10.1090\/mcom\/3834","type":"journal-article","created":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T09:13:56Z","timestamp":1676452436000},"page":"2217-2245","source":"Crossref","is-referenced-by-count":6,"title":["Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations"],"prefix":"10.1090","volume":"92","author":[{"given":"Zhou","family":"Sheng","sequence":"first","affiliation":[]},{"given":"Jianze","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qin","family":"Ni","sequence":"additional","affiliation":[]}],"member":"14","published-online":{"date-parts":[[2023,4,5]]},"reference":[{"issue":"3","key":"1","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1109\/TSP.2007.908999","article-title":"Steepest descent algorithms for optimization under unitary matrix constraint","volume":"56","author":"Abrudan, Traian E.","year":"2008","journal-title":"IEEE Trans. Signal Process.","ISSN":"https:\/\/id.crossref.org\/issn\/1053-587X","issn-type":"print"},{"issue":"3","key":"2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","article-title":"Trust-region methods on Riemannian manifolds","volume":"7","author":"Absil, P.-A.","year":"2007","journal-title":"Found. Comput. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/1615-3375","issn-type":"print"},{"issue":"2","key":"3","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/040605266","article-title":"Convergence of the iterates of descent methods for analytic cost functions","volume":"16","author":"Absil, P.-A.","year":"2005","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"4","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization algorithms on matrix manifolds","author":"Absil, P.-A.","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9780691132983"},{"key":"5","unstructured":"B. W. Bader, T. G. Kolda, et al., Matlab tensor toolbox version 2.6, February 2015, \\url{http:\/\/www.sandia.gov\/ tgkolda\/TensorToolbox\/}."},{"key":"6","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1017\/9781009166164","volume-title":"An introduction to optimization on smooth manifolds","author":"Boumal, Nicolas","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9781009166171"},{"key":"7","unstructured":"N. Boumal, B. Mishra, P.-A. Absil, and R. Sepulchre, Manopt, a Matlab toolbox for optimization on manifolds, J. Mach. Learn. Res. 15 (2014), 1455\u20131459."},{"issue":"1","key":"8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1049\/ip-h-1.1983.0004","article-title":"A complex gradient operator and its application in adaptive array theory","volume":"130","author":"Brandwood, D. H.","year":"1983","journal-title":"Proc. IEE-H","ISSN":"https:\/\/id.crossref.org\/issn\/0143-7097","issn-type":"print"},{"key":"9","doi-asserted-by":"crossref","unstructured":"J. F. Cardoso and A. Souloumiac, Blind beamforming for non-Gaussian signals, IEE Proc. F Radar Signal Process. 6 (1993), no. 140, 362\u2013370.","DOI":"10.1049\/ip-f-2.1993.0054"},{"issue":"4","key":"10","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070711621","article-title":"On the tensor SVD and the optimal low rank orthogonal approximation of tensors","volume":"30","author":"Chen, Jie","year":"2008","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"11","doi-asserted-by":"crossref","unstructured":"P. Comon, Independent component analysis, a new concept?, Signal Process. 36 (1994), no. 3, 287\u2013314.","DOI":"10.1016\/0165-1684(94)90029-9"},{"key":"12","unstructured":"P. Comon and C. Jutten (eds.), Handbook of Blind Source Separation, Academic Press, Oxford, 2010."},{"key":"13","unstructured":"L. De Lathauwer, B. De Moor, and J. Vandewalle, Blind source separation by simultaneous third-order tensor diagonalization, 1996 8th European Signal Processing Conference (EUSIPCO 1996), 1996, pp. 1\u20134."},{"key":"14","doi-asserted-by":"crossref","unstructured":"L. De Lathauwer, B. De Moor, and J. Vandewalle, Independent component analysis and (simultaneous) third-order tensor diagonalization, IEEE Trans. Signal Process. 49 (2001), no. 10, 2262\u20132271.","DOI":"10.1109\/78.950782"},{"issue":"6","key":"15","doi-asserted-by":"publisher","first-page":"e2202, 30","DOI":"10.1002\/nla.2202","article-title":"Nonlinearly preconditioned L-BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition","volume":"25","author":"De Sterck, Hans","year":"2018","journal-title":"Numer. Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1070-5325","issn-type":"print"},{"issue":"2","key":"16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","article-title":"The geometry of algorithms with orthogonality constraints","volume":"20","author":"Edelman, Alan","year":"1999","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"issue":"4","key":"17","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s002110050432","article-title":"A Procrustes problem on the Stiefel manifold","volume":"82","author":"Eld\u00e9n, Lars","year":"1999","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/070688316","article-title":"A Newton-Grassmann method for computing the best multilinear rank-(\ud835\udc5f\u2081,\ud835\udc5f\u2082,\ud835\udc5f\u2083) approximation of a tensor","volume":"31","author":"Eld\u00e9n, Lars","year":"2009","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"19","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/0024-3795(89)90494-1","article-title":"A constrained eigenvalue problem","volume":"114\/115","author":"Gander, Walter","year":"1989","journal-title":"Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0024-3795","issn-type":"print"},{"issue":"1","key":"20","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/16M1098759","article-title":"A new first-order algorithmic framework for optimization problems with orthogonality constraints","volume":"28","author":"Gao, Bin","year":"2018","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"21","series-title":"Johns Hopkins Studies in the Mathematical Sciences","isbn-type":"print","volume-title":"Matrix computations","author":"Golub, Gene H.","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/080185413X","edition":"3"},{"issue":"2","key":"22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10107-010-0409-z","article-title":"Approximation algorithms for homogeneous polynomial optimization with quadratic constraints","volume":"125","author":"He, Simai","year":"2010","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"3","key":"23","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s10589-019-00128-3","article-title":"An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors","volume":"75","author":"Hu, Shenglong","year":"2020","journal-title":"Comput. Optim. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0926-6003","issn-type":"print"},{"key":"24","unstructured":"S. Hu and K. Ye, Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations, Math. Program., Series A (2022), DOI 10.1007\/s10107-022-01867-8, \\url{https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01867-8}."},{"issue":"2","key":"25","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/11085743X","article-title":"Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors","volume":"34","author":"Ishteva, Mariya","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"issue":"1","key":"26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/090764827","article-title":"Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme","volume":"32","author":"Ishteva, Mariya","year":"2011","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"issue":"2","key":"27","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","article-title":"A framework of constraint preserving update schemes for optimization on Stiefel manifold","volume":"153","author":"Jiang, Bo","year":"2015","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"3","key":"28","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda, Tamara G.","year":"2009","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"key":"29","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/340","volume-title":"Function theory of several complex variables","author":"Krantz, Steven G.","year":"2001","ISBN":"https:\/\/id.crossref.org\/isbn\/0821827243"},{"key":"30","series-title":"Birkh\\\"{a}user Advanced Texts: Basler Lehrb\\\"{u}cher. [Birkh\\\"{a}user Advanced Texts: Basel Textbooks]","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-8134-0","volume-title":"A primer of real analytic functions","author":"Krantz, Steven G.","year":"2002","ISBN":"https:\/\/id.crossref.org\/isbn\/0817642641","edition":"2"},{"issue":"2","key":"31","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","article-title":"A splitting method for orthogonality constrained problems","volume":"58","author":"Lai, Rongjie","year":"2014","journal-title":"J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0885-7474","issn-type":"print"},{"issue":"1","key":"32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/17M1116295","article-title":"Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization","volume":"39","author":"Li, Jianze","year":"2018","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"33","doi-asserted-by":"crossref","unstructured":"\\bysame, On the convergence of Jacobi-type algorithms for independent component analysis, 2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM), IEEE, 2020, pp. 1\u20135.","DOI":"10.1109\/SAM48682.2020.9104331"},{"issue":"3","key":"34","first-page":"357","article-title":"Jacobi-type algorithm for low rank orthogonal approximation of symmetric tensors and its convergence analysis","volume":"17","author":"Li, Jianze","year":"2021","journal-title":"Pac. J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1348-9151","issn-type":"print"},{"key":"35","doi-asserted-by":"crossref","unstructured":"J. Li and S. Zhang, Polar decomposition-based algorithms on the product of Stiefel manifolds with applications in tensor approximation, J. Oper. Res. Soc., (2023), DOI: 10.1007\/s40305-023-00462-8.","DOI":"10.1007\/s40305-023-00462-8"},{"key":"36","doi-asserted-by":"crossref","unstructured":"Z. Li, S. He, and S. Zhang, Approximation methods for polynomial optimization: model, algorithms, and applications, SpringerBriefs in Optimization, Springer, New York, 2012.","DOI":"10.1007\/978-1-4614-3984-4"},{"issue":"3","key":"37","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/080729104","article-title":"Biquadratic optimization over unit spheres and semidefinite programming relaxations","volume":"20","author":"Ling, Chen","year":"2009","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"38","unstructured":"S. \u0141ojasiewicz, Ensembles semi-analytiques, IHES Notes (1965), \\url{https:\/\/perso.univ-rennes1.fr\/michel.coste\/Lojasiewicz.pdf}."},{"issue":"5","key":"39","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","article-title":"Sur la g\u00e9om\u00e9trie semi- et sous-analytique","volume":"43","author":"\u0141ojasiewicz, Stanislas","year":"1993","journal-title":"Ann. Inst. Fourier (Grenoble)","ISSN":"https:\/\/id.crossref.org\/issn\/0373-0956","issn-type":"print"},{"issue":"4","key":"40","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1137\/090772952","article-title":"A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints","volume":"20","author":"Luo, Zhi-Quan","year":"2010","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"41","doi-asserted-by":"crossref","unstructured":"J. H. Manton, Modified steepest descent and Newton algorithms for orthogonally constrained optimisation. Part I. The complex Stiefel manifold, Proceedings of the Sixth International Symposium on Signal Processing and its Applications, vol. 1, 2001, pp. 80\u201383.","DOI":"10.1109\/ISSPA.2001.949780"},{"issue":"3","key":"42","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1137\/060655924","article-title":"A Jacobi-type method for computing orthogonal tensor decompositions","volume":"30","author":"Moravitz Martin, Carla D.","year":"2008","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"issue":"3","key":"43","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1137\/19M1306889","article-title":"Hermitian tensor decompositions","volume":"41","author":"Nie, Jiawang","year":"2020","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"44","doi-asserted-by":"crossref","unstructured":"B. Pesquet-Popescu, J. C. Pesquet, and A. P. Petropulu, Joint singular value decomposition-a new tool for separable representation of images, Proceedings of the IEEE International Conference on Image Processing, Thessaloniki, Greece, 2001, pp. 569\u2013572.","DOI":"10.1109\/ICIP.2001.958556"},{"issue":"1","key":"45","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/140957822","article-title":"Convergence results for projected line-search methods on varieties of low-rank matrices via \u0141ojasiewicz inequality","volume":"25","author":"Schneider, Reinhold","year":"2015","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"2","key":"46","first-page":"309","article-title":"A new convergence proof for the higher-order power method and generalizations","volume":"11","author":"Uschmajew, Andr\u00e9","year":"2015","journal-title":"Pac. J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1348-9151","issn-type":"print"},{"issue":"4","key":"47","doi-asserted-by":"publisher","first-page":"2998","DOI":"10.1137\/19M125950X","article-title":"Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms","volume":"30","author":"Usevich, Konstantin","year":"2020","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1-2","key":"48","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","article-title":"A feasible method for optimization with orthogonality constraints","volume":"142","author":"Wen, Zaiwen","year":"2013","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"4","key":"49","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1137\/19M1303113","article-title":"The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence","volume":"41","author":"Yang, Yuning","year":"2020","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2023-92-343\/S0025-5718-2023-03834-0\/S0025-5718-2023-03834-0.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T05:00:33Z","timestamp":1776834033000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2023-92-343\/S0025-5718-2023-03834-0\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,5]]},"references-count":49,"journal-issue":{"issue":"343","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["S0025-5718-2023-03834-0"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/3834","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4,5]]}}}