Optimality conditions for non-negative group sparse constrained optimization problems
From MaRDI portal
Cites work
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- A convergent iterative hard thresholding for nonnegative sparsity optimization
- Compressed sensing
- Computation of second-order directional stationary points for group sparse optimization
- Decoding by Linear Programming
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Model Selection and Estimation in Regression with Grouped Variables
- On solutions of sparsity constrained optimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- Optimality conditions for sparse nonlinear programming
- Optimization problems involving group sparsity terms
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Structured variable selection with sparsity-inducing norms
- The benefit of group sparsity
This page was built for publication: Optimality conditions for non-negative group sparse constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996733)
