Dual principal component pursuit
From MaRDI portal
Recommendations
Cites work
- l_p-recovery of the most significant subspace among multiple subspaces with outliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A geometric analysis of subspace clustering with outliers
- A geometric approach to the trifocal tensor
- A novel M-estimator for robust PCA
- A pure \(L_1\)-norm principal component analysis
- Applications of geometric discrepancy in numerical analysis and statistics
- Block-Sparse Recovery via Convex Optimization
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Distributing many points on spheres: minimal energy and designs
- Dual principal component pursuit
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- scientific article; zbMATH DE number 5868113 (Why is no real title available?)
- scientific article; zbMATH DE number 1124580 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3346482 (Why is no real title available?)
- Iteratively reweighted least squares minimization for sparse recovery
- Least squares with a quadratic constraint
- Minimal Problems for the Calibrated Trifocal Variety
- Multiple View Geometry in Computer Vision
- On orthogonal linear \(\ell_1\) approximation
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Principal component analysis.
- Quadratically constrained least squares and quadratic problems
- Robust computation of linear models by convex relaxation
- Robust PCA via Outlier Pursuit
- Robust principal component analysis?
- Robust Statistics
- Solving quadratically constrained least squares problems using a differential-geometric approach
- Spherical Designs, Discrepancy and Numerical Integration
- Sums of distances between points on a sphere — an application of the theory of irregularities of distribution to discrete Geometry
- The cosparse analysis model and algorithms
- The ideal of the trifocal variety
Cited in
(12)- Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
- Robust computation of linear models by convex relaxation
- Modal principal component analysis
- Dual principal component pursuit
- l_p-recovery of the most significant subspace among multiple subspaces with outliers
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- Low rank approximation in the presence of outliers
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
- Fast, robust and non-convex subspace recovery
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- CDOpt: a Python package for a class of Riemannian optimization
- A constraint dissolving approach for nonsmooth optimization over the Stiefel manifold
This page was built for publication: Dual principal component pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558159)
