A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data
From MaRDI portal
Publication:6573016
DOI10.1137/22M1543653MaRDI QIDQ6573016
Publication date: 16 July 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27) Numerical methods of relaxation type (49M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An alternating direction method with continuation for nonconvex low rank minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Fast L1-L2 minimization via a proximal operator
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Kurdyka-Łojasiewicz exponent via inf-projection
- Weighted nuclear norm minimization and its applications to low level vision
- Nonsmooth analysis of singular values. I: Theory
- Calmness of partial perturbation to composite rank constraint systems and its applications
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Rank-Deficient and Discrete Ill-Posed Problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
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)