Pages that link to "Item:Q2515314"

The following pages link to Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery (Q2515314):

Displaying 10 items.

• Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit (Q1700711) (← links)
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
• Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
• Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization (Q2629808) (← links)
• Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization (Q2846490) (← links)
• 基于 Log-sum 惩罚的 Poisson 噪声下矩阵恢复算法 (Q3306324) (← links)
• Solving Systems of Quadratic Equations Via Exponential-Type Gradient Descent Algorithm (Q3385678) (← links)
• Minimization of the difference of Nuclear and Frobenius norms for noisy low rank matrix recovery (Q5221434) (← links)
• Weighted lp − l1 minimization methods for block sparse recovery and rank minimization (Q5856318) (← links)