Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
From MaRDI portal
Publication:6089961
DOI10.1016/j.ins.2021.07.035zbMath1529.15023OpenAlexW3180378035MaRDI QIDQ6089961
No author found.
Publication date: 15 December 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.07.035
Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Matrix completion problems (15A83)
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Iterative hard thresholding for compressed sensing
- Low rank matrix completion by alternating steepest descent methods
- Statistical complexity of the power method for Markov chains
- Matrix completion with \(\varepsilon\)-algorithm. In memory of Peter Wynn (1931--2017)
- Weighted nuclear norm minimization and its applications to low level vision
- Sparse subspace clustering for data with missing entries and high-rank matrix completion
- Efficient block-coordinate descent algorithms for the group Lasso
- Exact matrix completion via convex optimization
- \textsc{OCam}: out-of-core coordinate descent algorithm for matrix completion
- Robust Manhattan non-negative matrix factorization for image recovery and representation
- Low-Rank Matrix Completion by Riemannian Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- The complexity of matrix completion
- Light Field Inpainting Propagation via Low Rank Matrix Completion
- Matrix Completion Based on Non-Convex Low-Rank Approximation
- Low Dimensional Manifold Model for Image Processing
- Robust quaternion matrix completion with applications to image inpainting
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
