Matrix recovery from nonconvex regularized least absolute deviations

Cites Work

Unnamed Item
Unnamed Item
The $L_1$ penalized LAD estimator for high dimensional linear regression
Recovery of sparsest signals via $\ell^q $-minimization
Solving quadratic equations via phaselift when there are about as many equations as unknowns
Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Convex multi-task feature learning
Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$
Convex analysis approach to d. c. programming: Theory, algorithms and applications
Regularizing flows for constrained matrix-valued images
DC programming and DCA: thirty years of developments
Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
Optimal RIP bounds for sparse signals recovery via $\ell_p$ minimization
ROP: matrix recovery via rank-one projections
A non-convex algorithm framework based on DC programming and DCA for matrix completion
PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
Further properties of the forward-backward envelope with applications to difference-of-convex programming
Simultaneous analysis of Lasso and Dantzig selector
Phaselift is robust to a constant fraction of arbitrary errors
On the Schatten $p$-quasi-norm minimization for low-rank matrix recovery
Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
Robust principal component analysis?
A Singular Value Thresholding Algorithm for Matrix Completion
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
Restricted isometry properties and nonconvex compressive sensing
Decoding by Linear Programming
Least Absolute Deviations Curve-Fitting
Asymptotic Theory of Least Absolute Error Regression
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
Compressive Sensing Signal Reconstruction by Weighted Median Regression Estimates
Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements
Least absolute value regression: recent contributions
ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal
The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
Low rank matrix recovery with adversarial sparse noise*
Sparse Phase Retrieval Via PhaseLiftOff
Nonconvex Robust Low-Rank Matrix Recovery
Minimization of $\ell_{1-2}$ for Compressed Sensing
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Probability Inequalities for Sums of Bounded Random Variables
Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval

This page was built for publication: Matrix recovery from nonconvex regularized least absolute deviations