A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data
From MaRDI portal
Publication:6573016
Recommendations
- Matrix completion via minimizing an approximate rank
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- A nonconvex approach to low-rank matrix completion using convex optimization.
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- The application of non-convex rank approximation based on TV and gamma norm in matrix completion
Cites work
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 6276219 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- An alternating direction method with continuation for nonconvex low rank minimization
- Analysis of multi-stage convex relaxation for sparse regularization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Calmness of partial perturbation to composite rank constraint systems and its applications
- Clarke Subgradients of Stratifiable Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Fast L1-L2 minimization via a proximal operator
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Kurdyka-Łojasiewicz exponent via inf-projection
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Nearly unbiased variable selection under minimax concave penalty
- Nonsmooth analysis of singular values. I: Theory
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Rank-Deficient and Discrete Ill-Posed Problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Weighted nuclear norm minimization and its applications to low level vision
This page was built for publication: A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573016)
