Tensor Completion in Hierarchical Tensor Representations (Q3460842)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tensor Completion in Hierarchical Tensor Representations	scientific article

Statements

scholarly article

0 references

Tensor Completion in Hierarchical Tensor Representations (English)

0 references

0 references

Reinhold Schneider

0 references

Željka Stojanac

0 references

Compressed Sensing and its Applications

0 references

publication date

8 January 2016

0 references

full work available at URL

https://arxiv.org/abs/1404.3905

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the approximation of high-dimensional differential equations in the hierarchical Tucker format

0 references

Algorithms for Numerical Analysis in High Dimensions

0 references

Multivariate Regression and Machine Learning with Sums of Separable Functions

0 references

0 references

Iterative thresholding for sparse approximations

0 references

Iterative hard thresholding for compressed sensing

0 references

Exact matrix completion via convex optimization

0 references

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Ranks derived from multilinear maps

0 references

Optimization on the hierarchical Tucker manifold - applications to tensor completion

0 references

A Multilinear Singular Value Decomposition

0 references

On minimal subspaces in tensor representations

0 references

Tree-based tensor formats

0 references

A mathematical introduction to compressive sensing

0 references

Tensor completion and low-n-rank tensor recovery via convex optimization

0 references

Hierarchical Singular Value Decomposition of Tensors

0 references

A literature survey of low-rank tensor approximation techniques

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Tensorisation of vectors and their efficient convolution

0 references

Tensor Spaces and Numerical Tensor Calculus

0 references

Numerical tensor calculus

0 references

A new scheme for the tensor representation

0 references

Extraction of quantifiable information from complex systems

0 references

Tensor rank is NP-complete

0 references

Most Tensor Problems Are NP-Hard

0 references

On manifolds of tensors of fixed TT-rank

0 references

The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format

0 references

0 references

Tensor Decompositions and Applications

0 references

Low-rank tensor completion by Riemannian optimization

0 references

0 references

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

0 references

From quantum to classical molecular dynamics: Reduced models and numerical analysis.

0 references

Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors

0 references

A new tensor decomposition

0 references

Tensor-Train Decomposition

0 references

Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions

0 references

Algebraic Wavelet Transform via Quantics Tensor Train Decomposition

0 references

Low rank tensor recovery via iterative hard thresholding

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

A Simpler Approach to Matrix Completion

0 references

On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format

0 references

Approximation rates for the hierarchical tensor format in periodic Sobolev spaces

0 references

Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality

0 references

The density-matrix renormalization group in the age of matrix product states

0 references

Normalized Iterative Hard Thresholding for Matrix Completion

0 references

Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations

0 references

The geometry of algorithms using hierarchical tensors

0 references

Low-Rank Matrix Completion by Riemannian Optimization

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-16042-9_14

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3460842

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3460842&oldid=36222606"