Restricted isometry property of principal component pursuit with reduced linear measurements

DOI10.1155/2013/959403MaRDI QIDQ2375728zbMATH OpenOpenAlexWikidataFDO

Authors Qingshan You, Qun Wan, Haiwen Xu

Publication date 14 June 2013

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/959403

zbMATH Keywords

compressive principal component pursuitconvex optimizationprincipal component pursuit with reduced linear measurements

Mathematics Subject Classification ID

Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: The principal component pursuit with reduced linear measurements (PCP\_RLM) has gained great attention in applications, such as machine learning, video, and aligning multiple images. The recent research shows that strongly convex optimization for compressive principal component pursuit can guarantee the exact low-rank matrix recovery and sparse matrix recovery as well. In this paper, we prove that the operator of PCP\_RLM satisfies restricted isometry property (RIP) with high probability. In addition, we derive the bound of parameters depending only on observed quantities based on RIP property, which will guide us how to choose suitable parameters in strongly convex programming.

Recommendations

• Stable analysis of compressive principal component pursuit
• Compressive principal component pursuit
• Strongly convex programming for exact matrix completion and robust principal component analysis
• A strong restricted isometry property, with an application to phaseless compressed sensing
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds

Cites work

• A short note on strongly convex programming for exact matrix completion and robust principal component analysis
• Adaptive estimation of a quadratic functional by model selection.
• Compressive principal component pursuit
• Exact matrix completion via convex optimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Image recovery via total variation minimization and related problems
• Matrix concentration inequalities via the method of exchangeable pairs
• Robust principal component analysis?
• Strongly convex programming for exact matrix completion and robust principal component analysis

Cited in

(2)

• Stable analysis of compressive principal component pursuit
• A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit

This page was built for publication: Restricted isometry property of principal component pursuit with reduced linear measurements

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