Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms I: Cyclic Coordinate Descent with Spacer Steps Converges to a Coordinate-Wise MinimumResearch Paper
Best subset selection asks for the linear model that fits a response best using only a few of many candidate predictors. In its penalized form it is the least-squares problem with an penalty, the number of nonzero coefficients. The problem is NP-hard. Mixed-integer optimization can solve it to certified optimality at moderate sizes (Bertsimas, King,…