Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
From MaRDI portal
Publication:5131963
Abstract: We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence results, and prove local linear convergence of this algorithm.The convergence results also apply to the case of real-valued tensors.
Recommendations
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Block-Jacobi methods with Newton-steps and non-unitary joint matrix diagonalization
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
Cites work
- scientific article; zbMATH DE number 1817650 (Why is no real title available?)
- scientific article; zbMATH DE number 3705455 (Why is no real title available?)
- scientific article; zbMATH DE number 45789 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A global convergence proof for cyclic Jacobi methods with block rotations
- A new convergence proof for the higher-order power method and generalizations
- A proof of the Morse-Bott lemma.
- An Extrinsic Look at the Riemannian Hessian
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Complex-Valued Matrix Differentiation: Techniques and Key Results
- Contrasts, independent component analysis, and blind deconvolution
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence of the cyclic and quasi-cyclic block Jacobi methods
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Function theory of several complex variables
- Geodesic convexity in nonlinear optimization
- Global rates of convergence for nonconvex optimization on manifolds
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Hermitian tensor decompositions
- Jacobi Angles for Simultaneous Diagonalization
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- Jacobi's Algorithm on Compact Lie Algebras
- Lie Groups, Lie Algebras, and Representations
- Manopt, a Matlab toolbox for optimization on manifolds
- Morse Theory. (AM-51)
- Nondegenerate critical manifolds
- Numerical Methods for Simultaneous Diagonalization
- On the Convergence of the Jacobi Method for Arbitrary Orderings
- Optimization and dynamical systems
- Pointwise convergence of gradient‐like systems
- Quotient geometry with simple geodesics for the manifold of fixed-rank positive-semidefinite matrices
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Tensor decompositions for learning latent variable models
- The Geometry of Algorithms with Orthogonality Constraints
Cited in
(15)- Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- scientific article; zbMATH DE number 782075 (Why is no real title available?)
- Block-Jacobi methods with Newton-steps and non-unitary joint matrix diagonalization
- Sparse additive function decompositions facing basis transforms
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Trace maximization algorithm for the approximate tensor diagonalization
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
This page was built for publication: Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131963)
