A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING
From MaRDI portal
Publication:3122035
DOI10.1017/S1446181118000275zbMath1415.62049arXiv1804.07935OpenAlexW4245921574MaRDI QIDQ3122035
Publication date: 20 March 2019
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.07935
Linear regression; mixed models (62J05) Mixed integer programming (90C11) Multi-objective and goal programming (90C29)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Best subset selection via a modern optimization lens
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Subset selection for vector autoregressive processes via adaptive Lasso
- Near-ideal model selection by \(\ell _{1}\) minimization
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- A new Pareto set generating method for multi-criteria optimization problems
- Simultaneous analysis of Lasso and Dantzig selector
- Finding representative systems for discrete bicriterion optimization problems
- High-dimensional graphs and variable selection with the Lasso
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- Atomic Decomposition by Basis Pursuit
- Least absolute value regression: recent contributions
This page was built for publication: A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING
