Enhancing sparsity by reweighted $\ell _{1}$ minimization

DOI10.1007/s00041-008-9045-xzbMath1176.94014arXiv0711.1612WikidataQ56688960 ScholiaQ56688960MaRDI QIDQ734955

Emmanuel J. Candès, Stephen P. Boyd, Michael B. Wakin

Publication date: 14 October 2009

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

iterative algorithm; image processing; magnetic resonance imaging; signal theory; error correction; statistical estimation; sparsity; compressive sensing; majorization-minimization algorithm; $\ell_1$ minimization; sparse signal recovery; weighted $\ell_1$ minimization

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

Related Items

A unified approach to model selection and sparse recovery using regularized least squares, Analysis of a nonsmooth optimization approach to robust estimation, Entropy function-based algorithms for solving a class of nonconvex minimization problems, Adaptive identification of linear systems subject to Gross errors, Best subset selection via a modern optimization lens, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, A Barzilai-Borwein-like iterative half thresholding algorithm for the $L_{1/2}$ regularized problem, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, Accelerated compressed sensing based CT image reconstruction, DC approximation approaches for sparse optimization, Controller architectures: tradeoffs between performance and structure, Sharp MSE bounds for proximal denoising, Image denoising by generalized total variation regularization and least squares fidelity, Nodes selection strategy in cooperative tracking problem, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Reweighted $\ell_1$ minimization method for stochastic elliptic differential equations, A weighted $\ell_1$-minimization approach for sparse polynomial chaos expansions, The essential ability of sparse reconstruction of different compressive sensing strategies, Reweighted minimization model for MR image reconstruction with split Bregman method, Nonconvex compressed sampling of natural images and applications to compressed MR imaging, Manifold elastic net: a unified framework for sparse dimension reduction, Sparse occlusion detection with optical flow, Recovery of sparsest signals via $\ell^q $-minimization, A majorization-minimization approach to the sparse generalized eigenvalue problem, Smoothed state estimates under abrupt changes using sum-of-norms regularization, Sharp support recovery from noisy random measurements by $\ell_1$-minimization, A new TV-Stokes model with augmented Lagrangian method for image denoising and deconvolution, A unified algorithm for mixed $l_{2,p}$-minimizations and its application in feature selection, Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming, Subband adaptive filtering with $l_1$-norm constraint for sparse system identification, A sharp nonasymptotic bound and phase diagram of $L_{1/2}$ regularization, Sparse dual frames and dual Gabor functions of minimal time and frequency supports, Equivalence and strong equivalence between the sparsest and least $\ell _1$-norm nonnegative solutions of linear systems and their applications, DCA based algorithms for feature selection in multi-class support vector machine, GAITA: a Gauss-Seidel iterative thresholding algorithm for $\ell_q$ regularized least squares regression, The sparsest solutions to $Z$-tensor complementarity problems, Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization, Observability for initial value problems with sparse initial data, Identification of switched linear systems via sparse optimization, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, A non-adapted sparse approximation of PDEs with stochastic inputs, Compressed sensing with coherent and redundant dictionaries, Adaptive algorithms for sparse system identification, Restoration of images based on subspace optimization accelerating augmented Lagrangian approach, A majorization-minimization approach to variable selection using spike and slab priors, Equivalence of minimal $\ell _{0}$- and $\ell _{p }$-norm solutions of linear equalities, inequalities and linear programs for sufficiently small $p$, Inferring stable genetic networks from steady-state data, Nonconcave penalized composite conditional likelihood estimation of sparse Ising models, Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors, Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators, A chaotic iterative algorithm based on linearized Bregman iteration for image deblurring, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization, A constrained optimization reformulation and a feasible descent direction method for $L_{1/2}$ regularization, Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, Pruning of error correcting output codes by optimization of accuracy-diversity trade off, Comparison of parametric sparse recovery methods for ISAR image formation, SLOPE-adaptive variable selection via convex optimization, Iterative reweighted total generalized variation based Poisson noise removal model, Segmentation of ARX-models using sum-of-norms regularization, Estimating the dimension of a model, Variable selection via generalized SELO-penalized linear regression models, Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression, Optimal network design for synchronization of coupled oscillators, An improved algorithm for the $L_2-L_p$ minimization problem, A generalized elastic net regularization with smoothed $\ell _{q}$ penalty for sparse vector recovery, Online fault diagnosis for nonlinear power systems, Genetic algorithm versus classical methods in sparse index tracking, $\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization, A proximal difference-of-convex algorithm with extrapolation, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, RTE-based parameter reconstruction with $T V + L^1$ regularization, DC programming and DCA: thirty years of developments, Iterative reweighted methods for $\ell _1-\ell _p$ minimization, Templates for convex cone problems with applications to sparse signal recovery, Sparsity driven people localization with a heterogeneous network of cameras, Multi-parametric solution-path algorithm for instance-weighted support vector machines, The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso), Design of $\mathcal H_2$ $(\mathcal H_\infty)$-based optimal structured and sparse static output feedback gains, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, An approximate sparsity model for inpainting, From simple structure to sparse components: a review, Iterative reweighted noninteger norm regularizing SVM for gene expression data classification, A numerical exploration of compressed sampling recovery, Sensor selection strategies for state estimation in energy constrained wireless sensor networks, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Set membership identification of switched linear systems with known number of subsystems, Error analysis of reweighted $l_1$ greedy algorithm for noisy reconstruction, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, Rank-one and sparse matrix decomposition for dynamic MRI, Constructing optimal sparse portfolios using regularization methods, A smoothing iterative method for quantile regression with nonconvex $\ell_p$ penalty, Majorization-minimization generalized Krylov subspace methods for ${\ell _p}$-${\ell _q}$ optimization applied to image restoration, Non-convex TV denoising corrupted by impulse noise, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, On the adaptive elastic net with a diverging number of parameters, Recovery error analysis of noisy measurement in compressed sensing, Total generalized variation based denoising models for ultrasound images, Variational image colorization models using higher-order Mumford-Shah regularizers, Unnamed Item, Mixed H2/H∞-based actuator selection for uncertain polytopic systems with regional pole placement, Sparsest representations and approximations of an underdetermined linear system, A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging, Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information, A null-space-based weightedl₁minimization approach to compressed sensing, Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension, An algebra for periodic rhythms and scales, Decoupling noise and features via weighted ℓ ₁ -analysis compressed sensing, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, A Global Approach for Solving Edge-Matching Puzzles, Minimization of $\ell_{1-2}$ for Compressed Sensing, Portfolio Selection with Multiple Spectral Risk Constraints, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Sparse Bayesian linear regression using generalized normal priors, Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Sparsity-Assisted Signal Smoothing, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY, Zero‐attracting variable‐step‐size least mean square algorithms for adaptive sparse channel estimation, Phase Retrieval via Matrix Completion, Low-complexity $l_0$-norm penalized shrinkage linear and widely linear affine projection algorithms, Sparsity-promoting optimal control of systems with symmetries, consensus and synchronization networks, Maximum entropy vector kernels for MIMO system identification, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, Sparse adaptive channel estimation based on mixed controlled $l_2$ and $l_p$-norm error criterion, Model identification of a network as compressing sensing, Multi-stage convex relaxation for feature selection, Partial $S$-goodness for partially sparse signal recovery, Sparse multi-scale diffeomorphic registration: the kernel bundle framework, Efficient nonsmooth nonconvex optimization for image restoration and segmentation, Nonconvex sorted $\ell_1$ minimization for sparse approximation, Far Field Splitting by Iteratively Reweighted $\ell^1$ Minimization, Low Complexity Regularization of Linear Inverse Problems, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Sparse set membership identification of nonlinear functions and application to fault detection, Reconstructing gas distribution maps via an adaptive sparse regularization algorithm, Fast Implementation of ℓ 1-Greedy Algorithm, A Common Network Architecture Efficiently Implements a Variety of Sparsity-Based Inference Problems, A COMPRESSED SENSING FRAMEWORK OF FREQUENCY-SPARSE SIGNALS THROUGH CHAOTIC SYSTEM, An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence, On sparse representation of analytic signal in Hardy space, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, Constraint matrix factorization for space variant PSFs field restoration, Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation, On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING, A review on restoration of seismic wavefields based on regularization and compressive sensing, Design of structured dynamic output-feedback controllers for interconnected systems, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Recursive SURE for iterative reweighted least square algorithms, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, A smoothing majorization method for matrix minimization, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, Iteratively reweighted least squares minimization for sparse recovery

Uses Software

PDCO

Cites Work

Enhancing sparsity by reweighted \(\ell _{1}\) minimization