A bilinear formulation for vector sparsity optimization
From MaRDI portal
Publication:971247
DOI10.1016/j.sigpro.2007.08.015zbMath1186.94273OpenAlexW1975006876MaRDI QIDQ971247
Publication date: 19 May 2010
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2007.08.015
Related Items
DC approximation approaches for sparse optimization, Point source super-resolution via non-convex \(L_1\) based methods, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring, Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, Heuristics for Finding Sparse Solutions of Linear Inequalities, Sparse reconstruction via the mixture optimization model with iterative support estimate, Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem, \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery, Sparse Covariance Matrix Estimation by DCA-Based Algorithms, DCA based algorithms for feature selection in multi-class support vector machine, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem, Learning sparse classifiers with difference of convex functions algorithms
