A mixed-integer exponential cone programming formulation for feature subset selection in logistic regression

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Best subset selection via a modern optimization lens
Feature subset selection for logistic regression via mixed integer optimization
Mixed integer second-order cone programming formulations for variable selection in linear regression
Selecting massive variables using an iterated conditional modes/medians algorithm
Choosing the best set of variables in regression analysis using integer programming
Algorithm for cardinality-constrained quadratic optimization
Iterative regularization methods for nonlinear ill-posed problems
A discrete particle swarm optimization method for feature selection in binary classification problems
A variable selection method based on Tabu search for logistic regression models
A novel variational Bayesian method for variable selection in logistic regression models
An effective procedure for feature subset selection in logistic regression based on information criteria
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
Penalized regression, standard errors, and Bayesian Lassos
Lectures on Modern Convex Optimization
EMVS: The EM Approach to Bayesian Variable Selection
A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
Convex Maximization via Adjustable Robust Optimization
Gene selection for cancer classification using support vector machines
The Elements of Statistical Learning

This page was built for publication: A mixed-integer exponential cone programming formulation for feature subset selection in logistic regression