Efficient nonconvex sparse group feature selection via continuous and discrete optimization
From MaRDI portal
Publication:892230
Recommendations
- scientific article; zbMATH DE number 7312307
- High-dimensional sign-constrained feature selection and grouping
- Sparse optimization for nonconvex group penalized estimation
- Two-layer feature reduction for sparse-group Lasso via decomposition of convex sets
- A General Framework of Nonparametric Feature Selection in High-Dimensional Data
Cites work
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3147888 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3215519 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A group bridge approach for variable selection
- A selective review of group selection in high-dimensional models
- An O(n) algorithm for quadratic knapsack problems
- Analysis of multi-stage convex relaxation for sparse regularization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Introduction to algorithms
- Iterative hard thresholding for compressed sensing
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Likelihood-based selection and sharp parameter estimation
- Model Selection and Estimation in Regression with Grouped Variables
- Multi-stage convex relaxation for feature selection
- Numerical Optimization
- On the conditions used to prove oracle results for the Lasso
- Optimization with sparsity-inducing penalties
- Penalized methods for bi-level variable selection
- Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
- Proximal methods for hierarchical sparse coding
- Simultaneous analysis of Lasso and Dantzig selector
- Sparse Approximate Solutions to Linear Systems
- Sparse Reconstruction by Separable Approximation
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- SparseNet: coordinate descent with nonconvex penalties
- The Group Lasso for Logistic Regression
- The benefit of group sparsity
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(7)- DC programming and DCA: thirty years of developments
- Discrete optimization methods for group model selection in compressed sensing
- High-dimensional sign-constrained feature selection and grouping
- Weighted thresholding homotopy method for sparsity constrained optimization
- Two-layer feature reduction for sparse-group Lasso via decomposition of convex sets
- scientific article; zbMATH DE number 7312307 (Why is no real title available?)
- Convex optimization for group feature selection in networked data
This page was built for publication: Efficient nonconvex sparse group feature selection via continuous and discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892230)
