Majorized proximal alternating imputation for regularized rank constrained matrix completion
DOI10.1016/J.CAM.2019.112679zbMATH Open1433.65085OpenAlexW2997108278MaRDI QIDQ2297134FDOQ2297134
Authors: Shenfen Kuang, Hongyang Chao, Qia Li 
Publication date: 18 February 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.112679
Recommendations
- Matrix completion via minimizing an approximate rank
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
- Spectral regularization algorithms for learning large incomplete matrices
- Regularization methods for low-rank factorization of matrices with missing data
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
matrix completionnuclear normmajorization minimizationproximal alternating minimizationnon-convex regularizationbilinear factorization
Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Matrix completion from noisy entries
- Spectral regularization algorithms for learning large incomplete matrices
- Matrix completion and low-rank SVD via fast alternating least squares
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- One-step sparse estimates in nonconcave penalized likelihood models
- Variable selection using MM algorithms
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery
- Parallel matrix factorization for low-rank tensor completion
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Low-rank matrix completion by Riemannian optimization
- Low-rank matrix completion using alternating minimization
- Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Low-rank optimization with trace norm penalty
- Guaranteed Matrix Completion via Non-Convex Factorization
- Tensor completion using total variation and low-rank matrix factorization
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Affine matrix rank minimization problem via non-convex fraction function penalty
- Smooth PARAFAC Decomposition for Tensor Completion
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- Tensor Factorization for Low-Rank Tensor Completion
- Matrix factorization for low-rank tensor completion using framelet prior
Cited In (7)
- Linear total variation approximate regularized nuclear norm optimization for matrix completion
- Regularization methods for low-rank factorization of matrices with missing data
- Weighted hybrid truncated norm regularization method for low-rank matrix completion
- Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications
- Imputation and low-rank estimation with missing not at random data
- Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
- Block tensor train decomposition for missing data estimation
Uses Software
This page was built for publication: Majorized proximal alternating imputation for regularized rank constrained matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297134)
