Fast, robust and non-convex subspace recovery

DOI10.1093/imaiai/iax012zbMath1476.90262arXiv1406.6145OpenAlexW2409932664MaRDI QIDQ5242849

Tyler Maunu, Gilad Lerman

Publication date: 7 November 2019

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.6145

zbMATH Keywords

dimension reductionnon-convex optimizationiteratively reweighted least squaresrobust subspace recoveryminimization on the Grassmannian

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (18)

Simultaneous robust subspace recovery and semi-stability of quiver representations ⋮ On the rotational invariant \(L_1\)-norm PCA ⋮ Anisotropic Diffusion in Consensus-Based Optimization on the Sphere ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ⋮ Unnamed Item ⋮ On the robust PCA and Weiszfeld's algorithm ⋮ On spectral and numerical properties of random butterfly matrices ⋮ Distributed Robust Subspace Recovery ⋮ Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm ⋮ Modal Principal Component Analysis ⋮ FMS ⋮ A Well-Tempered Landscape for Non-convex Robust Subspace Recovery ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods

This page was built for publication: Fast, robust and non-convex subspace recovery