Solver tuning and model configuration

This paper addresses the problem of tuning parameters of mathematical solvers to increase their performance. We investigate how solvers can be tuned for models that undergo two types of configuration: variable configuration and constraint configuration. For each type, we investigate search algorithms for data generation that emphasizes exploration or exploitation. We show the difficulties for solver tuning in constraint configuration and how data generation methods affects a training sets learning potential