scientific article
From MaRDI portal
Publication:2941674
zbMath1323.15019MaRDI QIDQ2941674
No author found.
Publication date: 21 August 2015
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol11/p339.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
low-rank tensor completionTucker decompositionstrongly convex programmingsum of nuclear norms minimization
Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)
Related Items (14)
Tensor Completion in Hierarchical Tensor Representations ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ Iterative methods based on soft thresholding of hierarchical tensors ⋮ Parallel active subspace decomposition for tensor robust principal component analysis ⋮ Tensor completion by multi-rank via unitary transformation ⋮ Detection thresholds in very sparse matrix completion ⋮ Auto-weighted robust low-rank tensor completion via tensor-train ⋮ Fully-connected tensor network decomposition for robust tensor completion problem ⋮ Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ Low-rank tensor train for tensor robust principal component analysis ⋮ Tensor theta norms and low rank recovery ⋮ Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data ⋮ Optimization on the hierarchical Tucker manifold - applications to tensor completion
This page was built for publication:
