Optimization on the hierarchical Tucker manifold - applications to tensor completion

DOI10.1016/j.laa.2015.04.015zbMath1317.65136arXiv1405.2096OpenAlexW301566927MaRDI QIDQ2350002

Curt Da Silva, Felix J. Herrmann

Publication date: 18 June 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2096

zbMATH Keywords

algorithmsteepest descentdifferential geometryconjugate gradientGauss-Newtontensor completionlow-rank tensorhierarchical Tucker tensorsrecursive subspace factorizationsRiemannian manifold optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming in abstract spaces (90C48) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69) Methods of local Riemannian geometry (53B21)

Related Items (26)

Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization ⋮ Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format ⋮ Tensor Completion in Hierarchical Tensor Representations ⋮ Adaptive integration of nonlinear evolution equations on tensor manifolds ⋮ Iterative methods based on soft thresholding of hierarchical tensors ⋮ Low-rank tensor methods for partial differential equations ⋮ Constrained Optimization with Low-Rank Tensors and Applications to Parametric Problems with PDEs ⋮ Minimality of tensors of fixed multilinear rank ⋮ A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds ⋮ The numerical approximation of nonlinear functionals and functional differential equations ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Dynamically orthogonal tensor methods for high-dimensional nonlinear PDEs ⋮ Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations ⋮ Parallel tensor methods for high-dimensional linear PDEs ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure ⋮ A two-stage surrogate model for neo-Hookean problems based on adaptive proper orthogonal decomposition and hierarchical tensor approximation ⋮ A TT-Based Hierarchical Framework for Decomposing High-Order Tensors ⋮ T-product factorization method for internet traffic data completion with spatio-temporal regularization ⋮ Riemannian Optimization for High-Dimensional Tensor Completion ⋮ Enabling numerically exact local solver for waveform inversion -- a low-rank approach ⋮ Iterative algorithms for the post-processing of high-dimensional data ⋮ Stability analysis of hierarchical tensor methods for time-dependent PDEs ⋮ Stable als approximation in the TT-format for rank-adaptive tensor completion ⋮ The Condition Number of Riemannian Approximation Problems ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition

Uses Software

• TensorToolbox
• Spot
• htucker

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• The geometry of algorithms using hierarchical tensors
• Low-rank tensor completion by Riemannian optimization
• New inexact line search method for unconstrained optimization
• From quantum to classical molecular dynamics: Reduced models and numerical analysis.
• Convergence of line search methods for unconstrained optimization
• Black box approximation of tensors in hierarchical Tucker format
• A new scheme for the tensor representation
• The natural pseudo-distance as a quotient pseudo-metric, and applications
• On manifolds of tensors of fixed TT-rank
• Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Exact matrix completion via convex optimization
• Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
• A literature survey of low-rank tensor approximation techniques
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Hierarchical Singular Value Decomposition of Tensors
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Tensor Spaces and Numerical Tensor Calculus
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Tensor Completion in Hierarchical Tensor Representations
• A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
• A Multilinear Singular Value Decomposition
• Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
• Solution of Linear Systems and Matrix Inversion in the TT-Format
• Algorithm 941
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Low-Rank Optimization with Trace Norm Penalty

This page was built for publication: Optimization on the hierarchical Tucker manifold - applications to tensor completion