A proximal point like method for solving tensor least-squares problems
From MaRDI portal
Publication:2070322
DOI10.1007/s10092-021-00450-5zbMath1481.65071OpenAlexW3215766966MaRDI QIDQ2070322
Mao-Lin Liang, Yu-Tao Zheng, Bing Zheng
Publication date: 24 January 2022
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-021-00450-5
tensor eigenvalue problemmultilinear systemsTT-formatalternating linearized methodstensor least-squares problems
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- A new scheme for the tensor representation
- Solving sparse non-negative tensor equations: algorithms and applications
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A homotopy method for solving multilinear systems with M-tensors
- \(M\)-tensors and nonsingular \(M\)-tensors
- Eigenvalues of a real supersymmetric tensor
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A literature survey of low-rank tensor approximation techniques
- $M$-Tensors and Some Applications
- Hierarchical Singular Value Decomposition of Tensors
- High Order Bellman Equations and Weakly Chained Diagonally Dominant Tensors
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Shifted Power Method for Computing Tensor Eigenpairs
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Tensor Methods for Nonlinear Equations
- Exact solutions for the nonlinear Klein–Gordon and Liouville equations in four-dimensional Euclidean space
- Tensor Methods for Large, Sparse Unconstrained Optimization
- Splitting methods for tensor equations
- Low‐rank approximation of tensors via sparse optimization
- Generalized Canonical Polyadic Tensor Decomposition
- All Real Eigenvalues of Symmetric Tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A fast algorithm for solving circulant tensor systems
This page was built for publication: A proximal point like method for solving tensor least-squares problems