Iteratively reweighted least squares minimization for sparse recovery

DOI10.1002/cpa.20303zbMath1202.65046arXiv0807.0575OpenAlexW2119883478WikidataQ56564417 ScholiaQ56564417MaRDI QIDQ3655588

Massimo Fornasier, Ingrid Daubechies, Ronald A. DeVore, C. Sinan Güntürk

Publication date: 8 January 2010

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimization least squares sparse recovery restricted isometry property linear programming algorithms

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors, An efficient semismooth Newton method for adaptive sparse signal recovery problems, Orientation estimation of cryo-EM images using projected gradient descent method, A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm, Fault Resilient Domain Decomposition Preconditioner for PDEs, Sparse Online Variational Bayesian Regression, Sampling-based Spotlight SAR Image Reconstruction from Phase History Data for Speckle Reduction and Uncertainty Quantification, Sparse signal recovery by accelerated ℓ_q (0<q<1) thresholding algorithm, Recursive SURE for iterative reweighted least square algorithms, A smoothing majorization method for matrix minimization, Scalable Algorithms for Large Competing Risks Data, Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms, Empirical Bayesian Inference Using a Support Informed Prior, A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices, Framework for segmented threshold $\ell_0$ gradient approximation based network for sparse signal recovery, Model selection via reweighted partial sparse recovery, Sparse reconstruction via the mixture optimization model with iterative support estimate, Robust kernel principal component analysis with optimal mean, Discrete A Priori Bounds for the Detection of Corrupted PDE Solutions in Exascale Computations, Generalized Sparse Bayesian Learning and Application to Image Reconstruction, Smooth over-parameterized solvers for non-smooth structured optimization, Simultaneous Identification and Denoising of Dynamical Systems, FGC\_SS: fast graph clustering method by joint spectral embedding and improved spectral rotation, Sparsity-Assisted Signal Smoothing, A non-convex piecewise quadratic approximation of $\ell_0$ regularization: theory and accelerated algorithm, A general adaptive ridge regression method for generalized linear models: an iterative re-weighting approach, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, Rotation to sparse loadings using $L^p$ losses and related inference problems, On sparsity‐inducing methods in system identification and state estimation, A Lorentzian-$\ell_p$ norm regularization based algorithm for recovering sparse signals in two types of impulsive noise, $\ell_p$-norm minimization for outlier-resistant elliptic positioning in $\alpha$-stable impulsive interference, Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors, Total variation regularization on Riemannian manifolds by iteratively reweighted minimization, Compressive Sensing, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, An Algorithm for Real and Complex Rational Minimax Approximation, Sparse Solutions in Optimal Control of PDEs with Uncertain Parameters: The Linear Case, Hierachical Bayesian models and sparsity: ℓ ₂ -magic, A note on the minimization of a Tikhonov functional with ℓ¹-penalty, Heuristic discrepancy principle for variational regularization of inverse problems, An iteratively reweighted least squares algorithm for sparse regularization, Non-convex Optimization via Strongly Convex Majorization-minimization, A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal, Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, Learning Rates of l^q Coefficient Regularization Learning with Gaussian Kernel, Feature Matching with Bounded Distortion, Unnamed Item, Unnamed Item, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Unnamed Item, Low Complexity Regularization of Linear Inverse Problems, Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Sparse reconstructions from few noisy data: analysis of hierarchical Bayesian models with generalized gamma hyperpriors, Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices, Reliability enhancement of mixed-domain seismic inversion with bounding constraints, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, Characterization of ℓ1 minimizer in one-bit compressed sensing, Fast Implementation of ℓ 1-Greedy Algorithm, A COMPRESSED SENSING FRAMEWORK OF FREQUENCY-SPARSE SIGNALS THROUGH CHAOTIC SYSTEM, Multikernel Regression with Sparsity Constraint, On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, Minimization of $\ell_{1-2}$ for Compressed Sensing, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, Stable recovery of sparse signals with coherent tight frames via lp-analysis approach, An iterative algorithm for elliptic variational inequalities of the second kind, A smoothing iterative method for quantile regression with nonconvex $\ell_p$ penalty, Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, On the stability of projection-based model order reduction for convection-dominated laminar and turbulent flows, Global sensitivity analysis based on high-dimensional sparse surrogate construction, Nonlinear residual minimization by iteratively reweighted least squares, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms, Conjugate gradient acceleration of iteratively re-weighted least squares methods, Sequential image recovery from noisy and under-sampled Fourier data, Iteratively reweighted least squares and slime mold dynamics: connection and convergence, Restoration of manifold-valued images by half-quadratic minimization, Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization, Adaptive regularised kernel-based identification method for large-scale systems with unknown order, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, Screening for a reweighted penalized conditional gradient method, Variational image colorization models using higher-order Mumford-Shah regularizers, Error bounds for compressed sensing algorithms with group sparsity: A unified approach, Sparse microwave imaging: principles and applications, Speckle noise reduction via nonconvex high total variation approach, PROMP: a sparse recovery approach to lattice-valued signals, Smoothing strategy along with conjugate gradient algorithm for signal reconstruction, Multi-competitive viruses over time-varying networks with mutations and human awareness, Maximum entropy vector kernels for MIMO system identification, A necessary and sufficient condition for sparse vector recovery via $\ell_1-\ell_2$ minimization, A resilient domain decomposition polynomial chaos solver for uncertain elliptic PDEs, The finite steps of convergence of the fast thresholding algorithms with $f$-feedbacks in compressed sensing, A relaxed Kačanov iteration for the $p$-Poisson problem, Computation of time optimal control problems governed by linear ordinary differential equations, Conjugate gradient based acceleration for inverse problems, A generalized elastic net regularization with smoothed $\ell _{q}$ penalty for sparse vector recovery, Analysis of the equivalence relationship between $l_{0}$-minimization and $l_{p}$-minimization, Inducing multistability in discrete chaotic systems using numerical integration with variable symmetry, Robust signal recovery via $\ell_{1-2}/ \ell_p$ minimization with partially known support, Recovery of sparsest signals via $\ell^q $-minimization, $\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Affine matrix rank minimization problem via non-convex fraction function penalty, On the representation of functions with Gaussian wave packets, Phase retrieval: a data-driven wavelet frame based approach, Fast overcomplete dictionary construction with probabilistic guarantees, Effective zero-norm minimization algorithms for noisy compressed sensing, Robust fitting of ellipsoids by separating interior and exterior points during optimization, Iterative reweighted total generalized variation based Poisson noise removal model, Model identification of a network as compressing sensing, Primal and dual model representations in kernel-based learning, A superlinearly convergent $R$-regularized Newton scheme for variational models with concave sparsity-promoting priors, Greedy-like algorithms for the cosparse analysis model, A new fast multiphase image segmentation algorithm based on nonconvex regularizer, Recovery of signals under the condition on RIC and ROC via prior support information, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, Bound alternative direction optimization for image deblurring, Stability of 1-bit compressed sensing in sparse data reconstruction, Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming, Stable recovery of sparse signals via $\ell_p$-minimization, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, A new piecewise quadratic approximation approach for $L_0$ norm minimization problem, Compressed sensing with coherent tight frames via $l_q$-minimization for $0 < q \leq 1$, Equivalence and strong equivalence between the sparsest and least $\ell _1$-norm nonnegative solutions of linear systems and their applications, Global convergence of ADMM in nonconvex nonsmooth optimization, Reducing effects of bad data using variance based joint sparsity recovery, Sparse and nonnegative sparse D-MORPH regression, Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, A pseudo-heuristic parameter selection rule for $l^1$-regularized minimization problems, GAITA: a Gauss-Seidel iterative thresholding algorithm for $\ell_q$ regularized least squares regression, Sparse signal inversion with impulsive noise by dual spectral projected gradient method, Solving structured nonsmooth convex optimization with complexity $\mathcal {O}(\varepsilon ^{-1/2})$, Iterative reweighted methods for $\ell _1-\ell _p$ minimization, Iteration complexity analysis of block coordinate descent methods, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, Auto-weighted multi-view co-clustering with bipartite graphs, Rapid compressed sensing reconstruction: a semi-tensor product approach, Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization, Observability for initial value problems with sparse initial data, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, Weiszfeld's method: old and new results, Efficient regularized regression with $L_0$ penalty for variable selection and network construction, Numerical identification of a sparse Robin coefficient, A convergent overlapping domain decomposition method for total variation minimization, Sparse recovery by non-convex optimization - instance optimality, Iterative re-weighted least squares algorithm for $l_p$-minimization with tight frame and $0 < p \leq 1$, On the computation of sparse solutions to the controllability problem for discrete-time linear systems, Regularization of geophysical ill-posed problems by iteratively re-weighted and refined least squares, Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm, New regularization method and iteratively reweighted algorithm for sparse vector recovery, Broken adaptive ridge regression and its asymptotic properties, Robust multi-image processing with optimal sparse regularization, Efficient nonsmooth nonconvex optimization for image restoration and segmentation, Nonconvex sorted $\ell_1$ minimization for sparse approximation, $L_q$-closest-point to affine subspaces using the generalized Weiszfeld algorithm, A Laplacian approach to $\ell_1$-norm minimization, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods, An adaptation for iterative structured matrix completion, A simple Gaussian measurement bound for exact recovery of block-sparse signals, The $\ell_{2,q}$ regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Optimal RIP bounds for sparse signals recovery via $\ell_p$ minimization, Conditionally exponential prior in focal near- and far-field EEG source localization via randomized multiresolution scanning (RAMUS), Rank-one and sparse matrix decomposition for dynamic MRI, Adaptive identification of linear systems subject to Gross errors

Cites Work