Iterative methods based on soft thresholding of hierarchical tensors

DOI10.1007/s10208-016-9314-zzbMath1397.65243arXiv1501.07714OpenAlexW1543207505MaRDI QIDQ2407677

Markus Bachmayr, Reinhold Schneider

Publication date: 6 October 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

soft thresholdinglow-rank tensor approximationhierarchical tensor formathigh-dimensional elliptic problems

Mathematics Subject Classification ID

Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Multidimensional problems (41A63) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

Convergence bounds for empirical nonlinear least-squares, Quantized Tensor FEM for Multiscale Problems: Diffusion Problems in Two and Three Dimensions, Low-rank tensor methods for partial differential equations, Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic PDEs, HT-AWGM: a hierarchical Tucker-adaptive wavelet Galerkin method for high-dimensional elliptic problems, Sampling-free Bayesian inversion with adaptive hierarchical tensor representations, Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations, Greedy low-rank approximation in Tucker format of solutions of tensor linear systems, Modified iterations for data-sparse solution of linear systems, Weakly Intrusive Low-Rank Approximation Method for Nonlinear Parameter-Dependent Equations, Adaptive low-rank approximations for operator equations: Accuracy control and computational complexity, Stable als approximation in the TT-format for rank-adaptive tensor completion, Bayesian inversion for electromyography using low-rank tensor formats

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor-Train Decomposition
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
• On tensor completion via nuclear norm minimization
• Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
• Fixed point and Bregman iterative methods for matrix rank minimization
• Linear convergence of iterative soft-thresholding
• Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)
• Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
• On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems
• Approximate iterations for structured matrices
• Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
• A new scheme for the tensor representation
• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
• Adaptive Low-Rank Methods: Problems on Sobolev Spaces
• A literature survey of low-rank tensor approximation techniques
• Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
• CONVERGENCE OF A GREEDY ALGORITHM FOR HIGH-DIMENSIONAL CONVEX NONLINEAR PROBLEMS
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
• Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
• Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
• Hierarchical Singular Value Decomposition of Tensors
• A Singular Value Thresholding Algorithm for Matrix Completion
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
• Tensor Spaces and Numerical Tensor Calculus
• Multilevel preconditioning and adaptive sparse solution of inverse problems
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• An optimal adaptive wavelet method without coarsening of the iterands
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Adaptive wavelet methods for elliptic operator equations: Convergence rates
• Sparse Reconstruction by Separable Approximation
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Numerical tensor calculus
• Orthogonal Polynomials and the Construction of Piecewise Polynomial Smooth Wavelets
• THE EIGEN- AND SINGULAR VALUES OF THE SUM AND PRODUCT OF LINEAR OPERATORS
• A projection method to solve linear systems in tensor format
• Proximité et dualité dans un espace hilbertien
• Algorithms for Numerical Analysis in High Dimensions
• Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure
• Tensor numerical methods for multidimensional PDES: theoretical analysis and initial applications