Reweighted _1-minimization for sparse solutions to underdetermined linear systems
From MaRDI portal
Publication:4899025
compressed sensingunderdetermined linear systemconcave minimizationsparse solutionreweighted \(l_1\)-minimizationmerit function for sparsity
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)
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 𝓁1‐norm solution is also the sparsest solution
Cited in
(66)- A new computational method for the sparsest solutions to systems of linear equations
- Sparse solutions of underdetermined linear systems
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Analysis of a nonsmooth optimization approach to robust estimation
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- 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
- Sparse optimization theory and methods
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A new reweighted minimization algorithm for image deblurring
- Large-scale regression with non-convex loss and penalty
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- 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 _p-norm regularization
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Error analysis of reweighted l₁ greedy algorithm for noisy reconstruction
- Sparse recovery based on the generalized error function
- Triangulated surface denoising using high order regularization with dynamic weights
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- On sparse solutions of underdetermined linear systems
- Proximal mapping for symmetric penalty and sparsity
- 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
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- A generalized \(l_1\) greedy algorithm for image reconstruction in CT
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- A null-space-based weightedl1minimization approach to compressed sensing
- scientific article; zbMATH DE number 6746123 (Why is no real title available?)
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Scaled proximal gradient methods for sparse optimization problems
- Constructing New Weighted ℓ1-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\)
- 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
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- A Path-Based Approach to Constrained Sparse Optimization
- Variable selection in saturated and supersaturated designs via lp-lq minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Algorithms on the sparse solution of under-determined linear systems
- 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
- Sparse decomposition by iterating Lipschitzian-type mappings
- Minimization of \(\ell_{1-2}\) for compressed sensing
- A wonderful triangle in compressed sensing
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)
