Efficient nonconvex sparse group feature selection via continuous and discrete optimization

DOI10.1016/j.artint.2015.02.008zbMath1343.68210OpenAlexW1996777495MaRDI QIDQ892230

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

zbMATH Keywords

nonconvex optimizationerror bounddiscrete optimizationapplicationEEG data analysis

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05) Medical applications (general) (92C50)

Related Items

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

• UCI-ml
• CVX
• UNLocBoX
• SLEP
• sparsenet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Penalized methods for bi-level variable selection
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
• Iterative hard thresholding for compressed sensing
• An O(n) algorithm for quadratic knapsack problems
• The benefit of group sparsity
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
• On the conditions used to prove oracle results for the Lasso
• Simultaneous analysis of Lasso and Dantzig selector
• Multi-stage convex relaxation for feature selection
• Optimization with Sparsity-Inducing Penalties
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• SparseNet: Coordinate Descent With Nonconvex Penalties
• Decoding by Linear Programming
• The Group Lasso for Logistic Regression
• A group bridge approach for variable selection
• Two-Point Step Size Gradient Methods
• Numerical Optimization
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Sparse Reconstruction by Separable Approximation
• Sparse Approximate Solutions to Linear Systems
• De-noising by soft-thresholding
• Likelihood-Based Selection and Sharp Parameter Estimation
• Model Selection and Estimation in Regression with Grouped Variables
• A selective review of group selection in high-dimensional models