Robust _1 approaches to computing the geometric median and principal and independent components
From MaRDI portal
(Redirected from Publication:294428)
Robust \(\ell 1\) approaches to computing the geometric median and principal and independent components
Robust \(\ell 1\) approaches to computing the geometric median and principal and independent components
Recommendations
Cites work
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 6846220 (Why is no real title available?)
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A pure \(L_1\)-norm principal component analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Multivariate \(L_ 1\) mean.
- Optimization and nonsmooth analysis
- Principal component analysis.
- Robust PCA via Outlier Pursuit
- Robust computation of linear models by convex relaxation
- Robust principal component analysis?
- Sparse PCA: optimal rates and adaptive estimation
- Two proposals for robust PCA using semidefinite programming
Cited in
(2)
This page was built for publication: Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294428)