A sparse optimization approach for simultaneous orthogonal tensor diagonalization

DOI10.1016/J.AMC.2024.129203MaRDI QIDQ6994124zbMATH OpenFDO

Authors Xinying Li, Chao Chang, Jianze Li, Yuning Yang

Publication date 24 April 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2024.129203

zbMATH Keywords

global convergencesimultaneous diagonalizationsparse optimizationJacobi-type algorithmKurdyka-Łojasiewicz property

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Nonconvex programming, global optimization (90C26) Real-analytic functions (26E05) Orthogonalization in numerical linear algebra (65F25)

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• A Multilinear Singular Value Decomposition
• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• A generalized least-square matrix decomposition
• A unitary joint diagonalization algorithm for nonsymmetric higher‐order tensors based on Givens‐like rotations
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
• Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
• Conjugate gradient algorithm for optimization under unitary matrix constraint
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• CuBICA: Independent Component Analysis by Simultaneous Third- and Fourth-Order Cumulant Diagonalization
• Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
• Independent component analysis, a new concept?
• Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
• Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
• Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
• Manopt, a Matlab toolbox for optimization on manifolds
• Numerical Methods for Simultaneous Diagonalization
• On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
• On first-order algorithms for \(\ell_{1}/\)nuclear norm minimization
• Orthogonal low-rank approximation to third-order tensors with automatic rank estimation
• Orthogonal tensor decompositions
• Polar decomposition-based algorithms on the product of Stiefel manifolds with applications in tensor approximation
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Sparse representations in unions of bases
• Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
• Tensor Decompositions and Applications
• The doubly regularized support vector machine
• The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence

This page was built for publication: A sparse optimization approach for simultaneous orthogonal tensor diagonalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994124)