A bilinear formulation for vector sparsity optimization
From MaRDI portal
Publication:971247
DOI10.1016/J.SIGPRO.2007.08.015zbMATH Open1186.94273OpenAlexW1975006876MaRDI QIDQ971247FDOQ971247
Authors: Dori Peleg, Ron Meir 
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
Recommendations
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Learning sparse classifiers with difference of convex functions algorithms
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Greedy sparsity-constrained optimization
- A variational approach to sparsity optimization based on Lagrange multiplier theory
Cited In (20)
- Learning sparse classifiers with difference of convex functions algorithms
- \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
- A review on the adaptive-ridge algorithm with several extensions
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Sparse covariance matrix estimation by DCA-based algorithms
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- DC approximation approaches for sparse optimization
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- 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
- Point source super-resolution via non-convex \(L_1\) based methods
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- DCA based algorithms for feature selection in multi-class support vector machine
- Sparse \(L_0\)-norm least squares support vector machine with feature selection
This page was built for publication: A bilinear formulation for vector sparsity optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971247)
