Pages that link to "Item:Q1631426"
From MaRDI portal
The following pages link to Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization (Q1631426):
Displaying 14 items.
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
- A modulus-based iterative method for sparse signal recovery (Q2048821) (← links)
- An efficient algorithm for non-convex sparse optimization (Q2315622) (← links)
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q2632508) (← links)
- (Q2993796) (← links)
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm (Q4579171) (← links)
- One-bit compressed sensing via <i> <b>ℓ</b> </i> <sub> <i>p</i> </sub>(<b>0</b> <b><</b> <i>p</i> <b><</b> <b>1</b>)-minimization method (Q5000599) (← links)
- Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization (Q6078747) (← links)
- A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm (Q6162509) (← links)
- A Lorentzian-\(\ell_p\) norm regularization based algorithm for recovering sparse signals in two types of impulsive noise (Q6178626) (← links)
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal (Q6586648) (← links)
