Pages that link to "Item:Q4620615"

The following pages link to Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm (Q4620615):

Displaying 24 items.

• The benefit of group sparsity (Q987996) (← links)
• Variable selection via generalized SELO-penalized Cox regression models (Q1738526) (← links)
• GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (Q2135875) (← links)
• A perturbation analysis based on group sparse representation with orthogonal matching pursuit (Q2232085) (← links)
• A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
• The Group Lasso for Stable Recovery of Block-Sparse Signal Representations (Q4572875) (← links)
• Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization (Q4579300) (← links)
• (Q5037987) (← links)
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization (Q5105438) (← links)
• A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression (Q5107360) (← links)
• Computation of second-order directional stationary points for group sparse optimization (Q5210743) (← links)
• Sparse optimization for nonconvex group penalized estimation (Q5222360) (← links)
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions (Q5860273) (← links)
• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm (Q6043130) (← links)
• Solution sets of three sparse optimization problems for multivariate regression (Q6064025) (← links)
• Variable selection in additive models via hierarchical sparse penalty (Q6490395) (← links)
• Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems (Q6569683) (← links)
• A generalized formulation for group selection via ADMM (Q6571367) (← links)
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion (Q6581202) (← links)
• Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions (Q6584749) (← links)
• Subspace Newton method for sparse group \(\ell_0\) optimization problem (Q6607024) (← links)
• An Interactive Greedy Approach to Group Sparsity in High Dimensions (Q6621653) (← links)