Riemannian Optimization for High-Dimensional Tensor Completion
From MaRDI portal
Publication:2830626
DOI10.1137/15M1010506zbMath1352.65129WikidataQ115246975 ScholiaQ115246975MaRDI QIDQ2830626
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithm; numerical experiments; curse of dimensionality; low-rank approximation; Riemannian optimization; tensor completion; high-dimensional problems; tensor train format; matrix product states; data recovery; nonlinear conjugate gradient scheme
65K05: Numerical mathematical programming methods
15A69: Multilinear algebra, tensor calculus
15A83: Matrix completion problems
Uses Software