Pages that link to "Item:Q1946621"

The following pages link to Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621):

Displayed 12 items.

• An alternating direction method with continuation for nonconvex low rank minimization (Q257130) ‎ (← links)
• A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming (Q530249) ‎ (← links)
• Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) ‎ (← links)
• Sparse signal inversion with impulsive noise by dual spectral projected gradient method (Q1992541) ‎ (← links)
• Maximum correntropy adaptation approach for robust compressive sensing reconstruction (Q2004743) ‎ (← links)
• Low rank matrix recovery with impulsive noise (Q2171174) ‎ (← links)
• Group sparse recovery in impulsive noise via alternating direction method of multipliers (Q2197950) ‎ (← links)
• An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems (Q2226322) ‎ (← links)
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization (Q2509909) ‎ (← links)
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) ‎ (← links)
• Combining line search and trust-region methods for<b>ℓ1</b>-minimization (Q5028615) ‎ (← links)
• A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization (Q6045814) ‎ (← links)