Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems

DOI10.1137/110847445zbMath1261.65042OpenAlexW1981487911WikidataQ57445438 ScholiaQ57445438MaRDI QIDQ4899025

Publication date: 4 January 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110847445

zbMATH Keywords

concave minimization compressed sensing underdetermined linear system sparse solution reweighted $l_1$-minimization merit function for sparsity

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Inverse problems in linear algebra (15A29)

Related Items (50)

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 ⋮ Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization ⋮ Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ Recent advances in mathematical programming with semi-continuous variables and cardinality constraint ⋮ The finite steps of convergence of the fast thresholding algorithms with $f$-feedbacks in compressed sensing ⋮ Newton-type optimal thresholding algorithms for sparse optimization problems ⋮ Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Iteratively reweighted $\ell _1$ algorithms with extrapolation ⋮ Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ Sparse signal reconstruction via the approximations of $\ell_0$ quasinorm ⋮ Variable selection in saturated and supersaturated designs via lp-lq minimization ⋮ Large-scale regression with non-convex loss and penalty ⋮ A wonderful triangle in compressed sensing ⋮ A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set ⋮ Nonnegative partial $s$-goodness for the equivalence of a 0-1 linear program to weighted linear programming ⋮ Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing ⋮ Effective zero-norm minimization algorithms for noisy compressed sensing ⋮ Geological facies recovery based on weighted $\ell_1$-regularization ⋮ Scaled proximal gradient methods for sparse optimization problems ⋮ A Path-Based Approach to Constrained Sparse Optimization ⋮ A null-space-based weightedl₁minimization approach to compressed sensing ⋮ Proximal Mapping for Symmetric Penalty and Sparsity ⋮ Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming ⋮ Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation ⋮ The complexity results of the sparse optimization problems and reverse convex optimization problems ⋮ Equivalence and strong equivalence between the sparsest and least $\ell _1$-norm nonnegative solutions of linear systems and their applications ⋮ Triangulated Surface Denoising using High Order Regularization with Dynamic Weights ⋮ Sparse decomposition by iterating Lipschitzian-type mappings ⋮ Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization ⋮ A new reweighted minimization algorithm for image deblurring ⋮ On finding a generalized lowest rank solution to a linear semi-definite feasibility problem ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ Dual-density-based reweighted $\ell_1$-algorithms for a class of $\ell_0$-minimization problems ⋮ The nonconvex tensor robust principal component analysis approximation model via the weighted $\ell_p$-norm regularization ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ Partial gradient optimal thresholding algorithms for a class of sparse optimization problems ⋮ Weighted thresholding homotopy method for sparsity constrained optimization ⋮ Uniqueness Conditions for A Class of ℓ₀-Minimization Problems ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations ⋮ Error analysis of reweighted $l_1$ greedy algorithm for noisy reconstruction ⋮ Rank-one and sparse matrix decomposition for dynamic MRI ⋮ Analysis of a nonsmooth optimization approach to robust estimation ⋮ Entropy function-based algorithms for solving a class of nonconvex minimization problems

This page was built for publication: Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems