High-Dimensional Cost-constrained Regression Via Nonconvex Optimization
From MaRDI portal
Cites work
- A fast unified algorithm for solving group-lasso penalize learning problems
- A Statistical View of Some Chemometrics Regression Tools
- An Efficient Algorithm for the 0-1 Knapsack Problem
- Bayesian variable selection using cost-adjusted BIC, with application to cost-effective measurement of quality of health care
- Best subset selection via a modern optimization lens
- Comparing Stochastic Optimization Methods for Variable Selection in Binary Outcome Prediction, With Application to Health Policy
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Future paths for integer programming and links to artificial intelligence
- Gradient descent with non-convex constraints: local concavity determines convergence
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Lectures on stochastic programming. Modeling and theory.
- Model Selection and Estimation in Regression with Grouped Variables
- Nearly unbiased variable selection under minimax concave penalty
- Optimization by simulated annealing
- Regularization and Variable Selection Via the Elastic Net
- Tabu Search—Part I
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: High-Dimensional Cost-constrained Regression Via Nonconvex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631045)
