Reweighted _1-minimization for sparse solutions to underdetermined linear systems

DOI10.1137/110847445zbMATH Open1261.65042OpenAlexW1981487911WikidataQ57445438 ScholiaQ57445438MaRDI QIDQ4899025FDOQ4899025

Authors: Duan Li, Yun-Bin Zhao 

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

Recommendations

• A new computational method for the sparsest solutions to systems of linear equations
• Algorithms on the sparse solution of under-determined linear systems
• Sparse solutions of underdetermined linear systems
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution

zbMATH Keywords

compressed sensingunderdetermined linear systemconcave minimizationsparse solutionreweighted \(l_1\)-minimizationmerit function for sparsity

Mathematics Subject Classification ID

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

Cited In (66)

• Sparse recovery based on the generalized error function
• Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
• Heuristics for Finding Sparse Solutions of Linear Inequalities
• Scaled proximal gradient methods for sparse optimization problems
• A Path-Based Approach to Constrained Sparse Optimization
• Variable selection in saturated and supersaturated designs via lp-lq minimization
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
• A wonderful triangle in compressed sensing
• Newton-type optimal thresholding algorithms for sparse optimization problems
• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• Analysis of a nonsmooth optimization approach to robust estimation
• Sparse optimization theory and methods
• Entropy function-based algorithms for solving a class of nonconvex minimization problems
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
• A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
• A new reweighted minimization algorithm for image deblurring
• Large-scale regression with non-convex loss and penalty
• A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty
• The complexity results of the sparse optimization problems and reverse convex optimization problems
• Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
• The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction
• Triangulated surface denoising using high order regularization with dynamic weights
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• Proximal mapping for symmetric penalty and sparsity
• On sparse solutions of underdetermined linear systems
• DC approximation approach for \(\ell_0\)-minimization in compressed sensing
• Rank-one and sparse matrix decomposition for dynamic MRI
• A generalized Krylov subspace method for \(\ell_p\)-\(\ell_q\) minimization
• A generalized \(l_1\) greedy algorithm for image reconstruction in CT
• A null-space-based weightedl₁minimization approach to compressed sensing
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• Title not available (Why is that?)
• A unified primal dual active set algorithm for nonconvex sparse recovery
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation
• Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
• Uniqueness conditions for a class of \(\ell_{0}\)-minimization problems
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
• Sparse reconstruction via the mixture optimization model with iterative support estimate
• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
• Algorithms on the sparse solution of under-determined linear systems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
• Effective zero-norm minimization algorithms for noisy compressed sensing
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
• Weighted thresholding homotopy method for sparsity constrained optimization
• On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
• Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
• Geological facies recovery based on weighted \(\ell_1\)-regularization
• Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
• Weighted <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula>-Minimization for Generalized Non-Uniform Sparse Model
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Sparse decomposition by iterating Lipschitzian-type mappings
• A new computational method for the sparsest solutions to systems of linear equations
• Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
• Sparse solutions of underdetermined linear systems
• Nonconvex flexible sparsity regularization: theory and monotone numerical schemes

This page was built for publication: Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899025)