An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
From MaRDI portal
Publication:2307705
DOI10.1007/S10589-019-00128-3zbMATH Open1441.15019OpenAlexW2970873813WikidataQ114227035 ScholiaQ114227035MaRDI QIDQ2307705FDOQ2307705
Authors: Shenglong Hu 
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
Recommendations
- Rank properties and computational methods for orthogonal tensor decompositions
- Bounds on strongly orthogonal ranks of tensors
- Numerical computation for orthogonal low-rank approximation of tensors
- A convergence analysis for an algorithm computing a symmetric low rank orthogonal approximation of a symmetric tensor
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
Multilinear algebra, tensor calculus (15A69) Nonconvex programming, global optimization (90C26) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Matrix Analysis
- Independent component analysis, a new concept?
- Variational Analysis
- Orthogonal tensor decompositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Title not available (Why is that?)
- A Multilinear Singular Value Decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Lagrange Multipliers and Optimality
- Title not available (Why is that?)
- Most tensor problems are NP-hard
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Title not available (Why is that?)
- Tensor decompositions for learning latent variable models
- Tensor rank is NP-complete
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Rank-one approximation to high order tensors
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A collection of nonsmooth Riemannian optimization problems
- A singular value decomposition of a \(k\)-way array for a principal component analysis of multiway data, \(\text{PTA-}k\)
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- Generating polynomials and symmetric tensor decompositions
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- MA identification using fourth order cumulants
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Approximation hardness for a class of sparse optimization problems
Cited In (8)
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Relaxation of the rank-1 tensor approximation using different norms
- Bounds on strongly orthogonal ranks of tensors
- Rank properties and computational methods for orthogonal tensor decompositions
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
Uses Software
This page was built for publication: An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307705)
