Pages that link to "Item:Q2955982"
From MaRDI portal
The following pages link to A nonconvex approach to low-rank matrix completion using convex optimization (Q2955982):
Displaying 14 items.
- An alternating direction method with continuation for nonconvex low rank minimization (Q257130) (← links)
- Affine matrix rank minimization problem via non-convex fraction function penalty (Q1696454) (← links)
- A new nonconvex approach to low-rank matrix completion with application to image inpainting (Q1710943) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Low-rank matrix completion in a general non-orthogonal basis (Q2032243) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems (Q2143100) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Matrix completion for matrices with low-rank displacement (Q2203383) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- Transformed Schatten-1 iterative thresholding algorithms for low rank matrix completion (Q2627218) (← links)
- 基于 Log-sum 惩罚的 Poisson 噪声下矩阵恢复算法 (Q3306324) (← links)
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization (Q5006447) (← links)
- Incremental quaternion singular value decomposition and its application for low rank quaternion matrix completion (Q6590214) (← links)
