Iteratively reweighted group Lasso based on log-composite regularization
From MaRDI portal
Recommendations
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- Parallel block coordinate minimization with application to group regularized regression
- Subspace quadratic regularization method for group sparse multinomial logistic regression
Cites work
- L 1-Regularization Path Algorithm for Generalized Linear Models
- A fast unified algorithm for solving group-lasso penalize learning problems
- A Scale-Invariant Approach for Sparse Signal Recovery
- A selective review of group selection in high-dimensional models
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated Schemes for the $L_1/L_2$ Minimization
- Adaptive estimation with partially overlapping models
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Computing B-stationary points of nonsmooth DC programs
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Ensemble estimation and variable selection with semiparametric regression models
- Fast L1-L2 minimization via a proximal operator
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- scientific article; zbMATH DE number 47282 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Local Strong Homogeneity of a Regularized Estimator
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- MM optimization algorithms
- Model Selection and Estimation in Regression with Grouped Variables
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nearly unbiased variable selection under minimax concave penalty
- Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
- Stable signal recovery from incomplete and inaccurate measurements
- Structured sparsity via alternating direction methods
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- The Adaptive Lasso and Its Oracle Properties
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Group Lasso for Logistic Regression
- Uncertainty principles and ideal atomic decomposition
- Variable selection in quantile regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(4)- Recursive $\ell_{1,\infty}$ Group Lasso
- Regularized receiver operating characteristic-based logistic regression for grouped variable selection with composite criterion
- A generalized formulation for group selection via ADMM
- A general framework for group sparsity in hyperspectral unmixing using endmember bundles
This page was built for publication: Iteratively reweighted group Lasso based on log-composite regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5161764)
