High-Dimensional Cost-constrained Regression Via Nonconvex Optimization
From MaRDI portal
Publication:6631045
DOI10.1080/00401706.2021.1905071MaRDI QIDQ6631045
Yu Feng Liu, Guan Yu, Haoda Fu
Publication date: 31 October 2024
Published in: Technometrics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- Best subset selection via a modern optimization lens
- Gradient methods for minimizing composite functions
- Future paths for integer programming and links to artificial intelligence
- Bayesian variable selection using cost-adjusted BIC, with application to cost-effective measurement of quality of health care
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Tabu Search—Part I
- An Efficient Algorithm for the 0-1 Knapsack Problem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Statistical View of Some Chemometrics Regression Tools
- Gradient descent with non-convex constraints: local concavity determines convergence
- Regularization and Variable Selection Via the Elastic Net
- Comparing Stochastic Optimization Methods for Variable Selection in Binary Outcome Prediction, With Application to Health Policy
- Model Selection and Estimation in Regression with Grouped Variables
- A fast unified algorithm for solving group-lasso penalize learning problems
Related Items (1)
This page was built for publication: High-Dimensional Cost-constrained Regression Via Nonconvex Optimization
