Low rank matrix recovery with adversarial sparse noise*

DOI10.1088/1361-6420/ac44dczbMath1485.90135OpenAlexW4200591508MaRDI QIDQ5030160

Song Li, Jun Hong Lin, Hang Xu

Publication date: 16 February 2022

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/ac44dc

zbMATH Keywords

robustnessleast absolute deviationmatrix decompositioniterative hard thresholdinglow-rank matrix recoverymixed noisesubgradient descent

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Uses Software

• SDPLR

Cites Work

• Unnamed Item
• Unnamed Item
• The \(L_1\) penalized LAD estimator for high dimensional linear regression
• Iterative hard thresholding for compressed sensing
• A simple proof of the restricted isometry property for random matrices
• A framework for robust subspace learning
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors
• Subgradient methods for sharp weakly convex functions
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
• Matrix recipes for hard thresholding methods
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Convergence of projected Landweber iteration for matrix rank minimization
• Iterative hard thresholding for low-rank recovery from rank-one projections
• Phase retrieval: stability and recovery guarantees
• Exact matrix completion via convex optimization
• A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
• Restricted Isometry Property for General p-Norms
• Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
• Robust principal component analysis?
• Strong and Weak Convexity of Sets and Functions
• A Singular Value Thresholding Algorithm for Matrix Completion
• Weak Sharp Minima in Mathematical Programming
• Restricted isometry properties and nonconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Asymptotic Theory of Least Absolute Error Regression
• A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
• Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements
• Global Optimality in Low-Rank Matrix Optimization
• High-Dimensional Statistics
• ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal
• Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
• Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
• Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
• Nonconvex Robust Low-Rank Matrix Recovery
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• The nonsmooth landscape of phase retrieval
• Compressed sensing

This page was built for publication: Low rank matrix recovery with adversarial sparse noise*