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

DOI10.1007/S00041-008-9045-XzbMath1176.94014arXiv0711.1612OpenAlexW2107861471WikidataQ56688960 ScholiaQ56688960MaRDI QIDQ734955

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

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

Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (only showing first 100 items - show all)

Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery ⋮ Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection ⋮ Orientation estimation of cryo-EM images using projected gradient descent method ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization ⋮ An extrapolated iteratively reweighted $\ell_1$ method with complexity analysis ⋮ Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints ⋮ Nonconvex optimization with inertial proximal stochastic variance reduction gradient ⋮ High-dimensional sparse index tracking based on a multi-step convex optimization approach ⋮ Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Sparse feedback stabilization in high‐order linear systems ⋮ Smoothing neural network for $L_0$ regularized optimization problem with general convex constraints ⋮ Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning ⋮ Model selection via reweighted partial sparse recovery ⋮ Statistical Inference, Learning and Models in Big Data ⋮ Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ Neural network for a class of sparse optimization with $L_0$-regularization ⋮ Weighted sparsity regularization for source identification for elliptic PDEs ⋮ Variable selection in saturated and supersaturated designs via lp-lq minimization ⋮ Sparse and risk diversification portfolio selection ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Derivative-based SINDy (DSINDy): addressing the challenge of discovering governing equations from noisy data ⋮ Proximal variable metric method with spectral diagonal update for large scale sparse optimization ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs ⋮ Generalized Sparse Bayesian Learning and Application to Image Reconstruction ⋮ Sequential edge detection using joint hierarchical Bayesian learning ⋮ Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity ⋮ Simultaneous Identification and Denoising of Dynamical Systems ⋮ Inhomogeneous regularization with limited and indirect data ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ A wonderful triangle in compressed sensing ⋮ Iterative tensor eigen rank minimization for low-rank tensor completion ⋮ Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems ⋮ Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing ⋮ Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm ⋮ Joint modeling of playing time and purchase propensity in massively multiplayer online role-playing games using crossed random effects ⋮ Structured model selection via ℓ1−ℓ2 optimization ⋮ Sparsity-Assisted Signal Smoothing ⋮ Inexact proximal DC Newton-type method for nonconvex composite functions ⋮ Wavelets in the deep learning era ⋮ Sequential image recovery using joint hierarchical Bayesian learning ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ Variational Convexity of Functions and Variational Sufficiency in Optimization ⋮ A non-convex piecewise quadratic approximation of $\ell_0$ regularization: theory and accelerated algorithm ⋮ Saturation-value based higher-order regularization for color image restoration ⋮ A general adaptive ridge regression method for generalized linear models: an iterative re-weighting approach ⋮ Multi-period liability clearing via convex optimal control ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ PCA Sparsified ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Optimized data rate allocation for dynamic sensor fusion over resource constrained communication networks ⋮ A Lorentzian-$\ell_p$ norm regularization based algorithm for recovering sparse signals in two types of impulsive noise ⋮ Scaled proximal gradient methods for sparse optimization problems ⋮ Adaptive proximal SGD based on new estimating sequences for sparser ERM ⋮ Partial correlation graphical LASSO ⋮ Patch-based weighted SCAD prior for compressive sensing ⋮ Open issues and recent advances in DC programming and DCA ⋮ High Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods ⋮ Sparse learning of partial differential equations with structured dictionary matrix ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY ⋮ Direct numerical simulation of high-speed transition due to roughness elements ⋮ A framework for optimal actuator/sensor selection in a control system ⋮ Zero‐attracting variable‐step‐size least mean square algorithms for adaptive sparse channel estimation ⋮ Feature screening strategy for non-convex sparse logistic regression with log sum penalty ⋮ Converting pixel-type topology optimization results to MMC-representation based on sparse optimization and its applications ⋮ Phase Retrieval via Matrix Completion ⋮ Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization ⋮ The linearized alternating direction method of multipliers for low-rank and fused LASSO matrix regression model ⋮ Supervised-distributed control with joint performance and communication optimisation ⋮ Sparse high-dimensional fractional-norm support vector machine via DC programming ⋮ A linearly convergent algorithm for sparse signal reconstruction ⋮ Structured identification for network reconstruction of RC-models ⋮ Tuning parameter selection in sparse regression modeling ⋮ Best subset selection via a modern optimization lens ⋮ Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ 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 ⋮ Computation of sparse and dense equilibrium strategies of evolutionary games ⋮ A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron ⋮ Accelerated compressed sensing based CT image reconstruction ⋮ Variable selection via generalized SELO-penalized linear regression models ⋮ 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 ⋮ Improved adaptive sparse channel estimation using mixed square/fourth error criterion ⋮ A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs ⋮ Prior model identification during subsurface flow data integration with adaptive sparse representation techniques ⋮ The essential ability of sparse reconstruction of different compressive sensing strategies ⋮ Reweighted minimization model for MR image reconstruction with split Bregman method ⋮ Speckle noise reduction via nonconvex high total variation approach

Uses Software

PDCO

Cites Work

This page was built for publication: Enhancing sparsity by reweighted $\ell _{1}$ minimization

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