Robust Schatten-\(p\) norm based approach for tensor completion
From MaRDI portal
Publication:2291931
DOI10.1007/s10915-019-01108-9zbMath1436.90103OpenAlexW3000268401MaRDI QIDQ2291931
Publication date: 31 January 2020
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-019-01108-9
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Matrix completion problems (15A83)
Related Items (5)
Tensor completion via fully-connected tensor network decomposition with regularized factors ⋮ Riemannian conjugate gradient method for low-rank tensor completion ⋮ A generalized non-convex method for robust tensor completion ⋮ Duality Mapping for Schatten Matrix Norms ⋮ A new tensor multi-rank approximation with total variation regularization for tensor completion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Smooth minimization of non-smooth functions
- Parallel matrix factorization for low-rank tensor completion
- Matrix completion via max-norm constrained optimization
- Low-rank tensor completion by Riemannian optimization
- Von Neumann entropy penalization and low-rank matrix estimation
- Fixed point and Bregman iterative methods for matrix rank minimization
- An alternating direction algorithm for matrix completion with nonnegative factors
- On gradients of functions definable in o-minimal structures
- A mixture of nuclear norm and matrix factorization for tensor completion
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- A new scheme for the tensor representation
- Optimization theory and methods. Nonlinear programming
- Exact matrix completion via convex optimization
- Dictionary Learning for Noisy and Incomplete Hyperspectral Images
- 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
- Matrix completion via an alternating direction method
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Uniform-Geometric distribution
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Robust Schatten-\(p\) norm based approach for tensor completion
