An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
From MaRDI portal
Publication:2307705
DOI10.1007/s10589-019-00128-3zbMath1441.15019OpenAlexW2970873813WikidataQ114227035 ScholiaQ114227035MaRDI QIDQ2307705
Publication date: 25 March 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00128-3
Nonconvex programming, global optimization (90C26) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- MA identification using fourth order cumulants
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Independent component analysis, a new concept?
- A singular value decomposition of a \(k\)-way array for a principal component analysis of multiway data, \(\text{PTA-}k\)
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A collection of nonsmooth Riemannian optimization problems
- Generating polynomials and symmetric tensor decompositions
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Orthogonal Tensor Decompositions
- Rank-One Approximation to High Order Tensors
- Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
- Tensor decompositions for learning latent variable models
- A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms
- Lagrange Multipliers and Optimality
- Tensor rank is NP-complete
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Matrix Analysis
- Variational Analysis
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A Multilinear Singular Value Decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Most Tensor Problems Are NP-Hard
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
