Computing the proximal operator of the q-th power of the _1,q -norm for group sparsity
From MaRDI portal
Publication:6932289
Cites work
- $\ell _{2,p}$ -Norm Based PCA for Image Recognition
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
- A constructive approach for computing the proximity operator of the \(p\)-th power of the \(\ell_1\) norm
- Analysis of multi-stage convex relaxation for sparse regularization
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- CRC standard mathematical tables and formulas
- Consistency of the group Lasso and multiple kernel learning
- Convergence analysis of iteratively reweighted _1 algorithms for computing the proximal operator of _p-norm
- Fast L1-L2 minimization via a proximal operator
- First-order methods in optimization
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Group-Sparse Model Selection: Hardness and Relaxations
- Iterative thresholding for sparse approximations
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Learning Discriminative Dictionary for Group Sparse Representation
- Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints
- Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee
- Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
- Model Selection and Estimation in Regression with Grouped Variables
- Nearly unbiased variable selection under minimax concave penalty
- Optimization problems involving group sparsity terms
- Robust Recovery of Signals From a Structured Union of Subspaces
- The Group Lasso for Logistic Regression
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- The proximity operator of the log-sum penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Computing the proximal operator of the \(q\)-th power of the \(\ell_{1,q} \)-norm for group sparsity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932289)