Pages that link to "Item:Q435847"
From MaRDI portal
The following pages link to Strongly convex programming for exact matrix completion and robust principal component analysis (Q435847):
Displaying 14 items.
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
- Linear convergence of the randomized sparse Kaczmarz method (Q1717238) (← links)
- A short note on strongly convex programming for exact matrix completion and robust principal component analysis (Q1951316) (← links)
- A relaxed parameter condition for the primal-dual hybrid gradient method for saddle-point problem (Q2097452) (← links)
- Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems (Q2227534) (← links)
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization (Q2361128) (← links)
- Restricted isometry property of principal component pursuit with reduced linear measurements (Q2375728) (← links)
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds (Q2515360) (← links)
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions (Q2821800) (← links)
- Accelerated Uzawa methods for convex optimization (Q2970101) (← links)
- Matrix completion and related problems via strong duality (Q4993268) (← links)
- Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion (Q5025789) (← links)
- Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity (Q6038639) (← links)
