Pages that link to "Item:Q4578842"

The following pages link to Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization (Q4578842):

Displaying 12 items.

• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
• Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
• Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
• Effective zero-norm minimization algorithms for noisy compressed sensing (Q2198627) (← links)
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing (Q2672726) (← links)
• Constructing New Weighted <i>ℓ</i>₁-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
• The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
• A New Computational Method for the Sparsest Solutions to Systems of Linear Equations (Q5258945) (← links)
• Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery (Q6053460) (← links)
• A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems (Q6055067) (← links)
• Distributed continuous-time accelerated neurodynamic approaches for sparse recovery via smooth approximation to \(L_1\)-minimization (Q6535872) (← links)