Pages that link to "Item:Q4579171"

The following pages link to <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm (Q4579171):

Displayed 27 items.

• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) ‎ (← links)
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) ‎ (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) ‎ (← links)
• GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) ‎ (← links)
• MOEA/D with chain-based random local search for sparse optimization (Q1626237) ‎ (← links)
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) ‎ (← links)
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\) (Q1666063) ‎ (← links)
• A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem (Q1729942) ‎ (← links)
• Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) ‎ (← links)
• Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) ‎ (← links)
• Sparse principal component analysis via fractional function regularity (Q2007153) ‎ (← links)
• Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction (Q2179318) ‎ (← links)
• Image restoration via the adaptive \(TV^p\) regularization (Q2194779) ‎ (← links)
• Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction (Q2198239) ‎ (← links)
• Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property (Q2231349) ‎ (← links)
• Remote sensing images destriping using unidirectional hybrid total variation and nonconvex low-rank regularization (Q2315922) ‎ (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) ‎ (← links)
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization (Q3457189) ‎ (← links)
• One-bit compressed sensing via <i> <b>ℓ</b> </i> _<i>p</i>(<b>0</b> <b>&lt;</b> <i>p</i> <b>&lt;</b> <b>1</b>)-minimization method (Q5000599) ‎ (← links)
• A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization (Q5016825) ‎ (← links)
• Non-convex Optimization via Strongly Convex Majorization-minimization (Q5148071) ‎ (← links)
• An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) ‎ (← links)
• Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) ‎ (← links)
• Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints (Q6051303) ‎ (← links)
• A wonderful triangle in compressed sensing (Q6122304) ‎ (← links)
• A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm (Q6162509) ‎ (← links)
• Identifying stochastic governing equations from data of the most probable transition trajectories (Q6191971) ‎ (← links)