Local convergence of the alternating least squares algorithm for canonical tensor approximation

DOI10.1137/110843587zbMATH Open1252.65085OpenAlexW2014617517MaRDI QIDQ2910973FDOQ2910973

Authors: André Uschmajew 

Publication date: 12 September 2012

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110843587

Recommendations

• On global convergence of alternating least squares for tensor approximation
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• On local convergence of alternating schemes for optimization of convex problems in the tensor train format
• The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
• A new convergence proof for the higher-order power method and generalizations

zbMATH Keywords

tensorlow-rank approximationLagrange multiplierslocal convergenceglobal minimizationalternating least square algorithmnonlinear Gauss-Seidel method, PARAFAC

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Multilinear algebra, tensor calculus (15A69) Iterative numerical methods for linear systems (65F10)

Cited In (73)

• On local convergence of alternating schemes for optimization of convex problems in the tensor train format
• The numerical approximation of nonlinear functionals and functional differential equations
• Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications
• Preservation of linear constraints in approximation of tensors
• Gradient-based optimization for regression in the functional tensor-train format
• Low-CP-rank tensor completion via practical regularization
• Rank-1 approximation for entangled multipartite real systems
• Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
• Towards an efficient use of the BLAS library for multilinear tensor contractions
• Local convergence of alternating low‐rank optimization methods with overrelaxation
• Convergence rate analysis for the higher order power method in best rank one approximations of tensors
• Musings on multilinear fitting
• Algebraic groups. Abstracts from the workshop held April 18--24, 2021 (hybrid meeting)
• Low-rank tensor methods for partial differential equations
• A trust-region-based alternating least-squares algorithm for tensor decompositions
• A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
• Alternating least squares as moving subspace correction
• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• A nonlinearly preconditioned conjugate gradient algorithm for rank-\(R\) canonical tensor approximation.
• Statistically optimal and computationally efficient low rank tensor completion from noisy entries
• Local convergence of tensor methods
• Tensor decomposition for learning Gaussian mixtures from moments
• Numerical approximation of Poisson problems in long domains
• Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
• Title not available (Why is that?)
• Unfoldings and the rank-one approximation of the tensor
• A new convergence proof for the higher-order power method and generalizations
• Tensor methods for the Boltzmann-BGK equation
• The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
• On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
• A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis
• Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
• Convergence of the sequence of parameters generated by alternating least squares algorithms
• Tensor representation of non-linear models using cross approximations
• Nesterov acceleration of alternating least squares for canonical tensor decomposition: momentum step size selection and restart mechanisms.
• An approximation method of CP rank for third-order tensor completion
• On approximation algorithm for orthogonal low-rank tensor approximation
• The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
• Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
• Riemannian Newton optimization methods for the symmetric tensor approximation problem
• Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
• Structure of the Hessian matrix and an economical implementation of Newton's method in the problem of canonical approximation of tensors
• On accelerating the regularized alternating least-squares algorithm for tensors
• Optimization problems in contracted tensor networks
• On optimal low rank Tucker approximation for tensors: the case for an adjustable core size
• A dynamical adaptive tensor method for the Vlasov-Poisson system
• On the convergence of alternating minimization methods in variational PGD
• A locally convergent Jacobi iteration for the tensor singular value problem
• On global convergence of alternating least squares for tensor approximation
• Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
• A literature survey of low-rank tensor approximation techniques
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
• Finding a low-rank basis in a matrix subspace
• Parallel tensor methods for high-dimensional linear PDEs
• The geometry of algorithms using hierarchical tensors
• Numerical tensor calculus
• Adaptive force biasing algorithms: new convergence results and tensor approximations of the bias
• Optimal Point Sets for Quasi-Monte Carlo Integration of Bivariate Periodic Functions with Bounded Mixed Derivatives
• On the asymptotic linear convergence speed of Anderson acceleration, Nesterov acceleration, and nonlinear GMRES
• Some properties of the normed alternating least squares (ALS) algorithm
• Global convergence of rank-one PGD approximations by alternate minimization
• SOTT: greedy approximation of a tensor as a sum of tensor trains
• Accelerated estimation of switching algorithms: the cointegrated VAR model and other applications
• Numerical Approximation of PGD Modes to Parameterized Elliptic Problems
• Multiresolution low-rank tensor formats
• Implicit integration of nonlinear evolution equations on tensor manifolds
• CP decomposition and low-rank approximation of antisymmetric tensors
• Title not available (Why is that?)
• Multi-armed linear bandits with latent biases
• On the theory of low-rank approximation in tensor products of Hilbert spaces
• Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
• Tensor ring decomposition: optimization landscape and one-loop convergence of alternating least squares

This page was built for publication: Local convergence of the alternating least squares algorithm for canonical tensor approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910973)