A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
In the introduction the authors ``consider a rank approximation algorithm for tensors represented in the canonical format in arbitrary pre-Hilbert tensor product spaces. It is shown that the original approximation problem is equivalent to a finite-dimensional \(l_2\) minimization problem. The \(l_2\) minimization problem is solved by a regularized Newton method which requires the computation and evaluation of the first and second derivative of the objective function. A systematic choice of the initial guess for the iterative scheme is introduced. The effectiveness of the approach is demonstrated in numerical experiments.
- Structure of the Hessian matrix and an economical implementation of Newton's method in the problem of canonical approximation of tensors
- The Best rank-\((R_1,R_2,R_3)\) approximation of tensors by means of a geometric Newton method
- A Newton-Grassmann method for computing the best multilinear rank-(r₁,r₂,r₃) approximation of a tensor
- Black box low tensor-rank approximation using fiber-crosses
- A modified Newton's method for best rank-one approximation to tensors
- Algorithms for Numerical Analysis in High Dimensions
- Approximate iterations for structured matrices
- Approximation of 1/x by exponential sums in [1, ∞)
- scientific article; zbMATH DE number 3624709 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Multilinear Algebra
- Numerical operator calculus in higher dimensions
- Rank-one approximation to high order tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Optimization via separated representations and the canonical tensor decomposition
- The numerical approximation of nonlinear functionals and functional differential equations
- Musings on multilinear fitting
- Variational calculus with sums of elementary tensors of fixed rank
- Parallel tensor methods for high-dimensional linear PDEs
- An optimization approach for dynamical Tucker tensor approximation
- Mesh-free canonical tensor products for six-dimensional density matrix: computation of kinetic energy
- Numerical tensor techniques for multidimensional convolution products
- Rank properties and computational methods for orthogonal tensor decompositions
- A literature survey of low-rank tensor approximation techniques
- A nonlinear GMRES optimization algorithm for canonical tensor decomposition
- Structure of the Hessian matrix and an economical implementation of Newton's method in the problem of canonical approximation of tensors
- Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Preservation of linear constraints in approximation of tensors
- Fast revealing of mode ranks of tensor in canonical form
- Numerical tensor calculus
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- Algorithm 941: \texttt{htucker} -- a Matlab toolbox for tensors in hierarchical Tucker format
- The dynamics of swamps in the canonical tensor approximation problem
- Tensor spaces and hierarchical tensor representations
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Numerical Approximation of PGD Modes to Parameterized Elliptic Problems
- Minimization methods for approximating tensors and their comparison
- Randomized interpolative decomposition of separated representations
- Iterative algorithms for the post-processing of high-dimensional data
- Linear algebra for tensor problems
- Black box low tensor-rank approximation using fiber-crosses
This page was built for publication: A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1938432)
