Efficient nonconvex sparse group feature selection via continuous and discrete optimization
From MaRDI portal
Publication:892230
DOI10.1016/J.ARTINT.2015.02.008zbMATH Open1343.68210OpenAlexW1996777495MaRDI QIDQ892230FDOQ892230
Xiaotong Shen, Jieping Ye, Shuo Xiang
Publication date: 18 November 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2015.02.008
Learning and adaptive systems in artificial intelligence (68T05) Medical applications (general) (92C50) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Penalized methods for bi-level variable selection
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Numerical Optimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On the conditions used to prove oracle results for the Lasso
- Simultaneous analysis of Lasso and Dantzig selector
- Analysis of multi-stage convex relaxation for sparse regularization
- Model Selection and Estimation in Regression with Grouped Variables
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Introduction to algorithms
- The Group Lasso for Logistic Regression
- Two-Point Step Size Gradient Methods
- A selective review of group selection in high-dimensional models
- Decoding by Linear Programming
- A group bridge approach for variable selection
- Likelihood-Based Selection and Sharp Parameter Estimation
- The benefit of group sparsity
- De-noising by soft-thresholding
- Sparse Reconstruction by Separable Approximation
- Iterative hard thresholding for compressed sensing
- Optimization with sparsity-inducing penalties
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Sparse Approximate Solutions to Linear Systems
- Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
- An O(n) algorithm for quadratic knapsack problems
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Multi-stage convex relaxation for feature selection
Cited In (5)
- Title not available (Why is that?)
- Discrete optimization methods for group model selection in compressed sensing
- DC programming and DCA: thirty years of developments
- High-dimensional sign-constrained feature selection and grouping
- Weighted thresholding homotopy method for sparsity constrained optimization
Uses Software
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)
