Pages that link to "Item:Q971247"

The following pages link to A bilinear formulation for vector sparsity optimization (Q971247):

Displaying 17 items.

• DC approximation approaches for sparse optimization (Q319281) (← links)
• Point source super-resolution via non-convex \(L_1\) based methods (Q333212) (← links)
• DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
• Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
• Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring (Q2185626) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
• Learning sparse classifiers with difference of convex functions algorithms (Q2867410) (← links)
• A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem (Q3192668) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
• Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
• Sparse reconstruction via the mixture optimization model with iterative support estimate (Q6065953) (← links)
• Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery (Q6144050) (← links)