Abstract:
Column generation is a well-known decomposition method to solve linear and mixed integer problems with a large number of variables. A similar column generation decomposition method can be constructed for conic optimization problems. In this talk we present work that explores whether this can be a competitive solution method for the continuous relaxation of the feature selection problem.