Pages that link to "Item:Q1718892"
From MaRDI portal
The following pages link to A generalized robust minimization framework for low-rank matrix recovery (Q1718892):
Displaying 16 items.
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit (Q368099) (← 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)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation (Q776102) (← links)
- New robust principal component analysis for joint image alignment and recovery via affine transformations, Frobenius and \(L_{2,1}\) norms (Q779978) (← links)
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm (Q2095019) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- Robust low-rank data matrix approximations (Q2360958) (← links)
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data (Q2440136) (← links)
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods (Q2830569) (← links)
- A smoothing majorization method for matrix minimization (Q3458812) (← links)
- An Unbiased Approach to Low Rank Recovery (Q5055687) (← links)
- Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm (Q5105063) (← links)
- A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices (Q5370394) (← links)
