Stable Principal Component Pursuit via Convex Analysis

DOI10.1109/TSP.2019.2907264MaRDI QIDQ5238805zbMATH OpenOpenAlexWikidataFDO

Authors Lei Yin, Ankit Parekh, Ivan W. Selesnick

Publication date 28 October 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2019.2907264

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(5)

• Pca stability studied by the bootstrap and the infinitesimal jackknife method
• Stability and Convergence of Principal Component Learning Algorithms
• Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
• Stable local-smooth principal component pursuit
• Dynamic mode decomposition via difference-of-convex principal component analysis

This page was built for publication: Stable Principal Component Pursuit via Convex Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238805)