Towards Automatic Linearization via SMT Solving
<|reference_start|>Towards Automatic Linearization via SMT Solving: Mathematical optimization is ubiquitous in modern applications. However, in practice, we often need to use nonlinear optimization models, for which the existing optimization tools such as Cplex or Gurobi may not be directly applicable and an (error-prone) manual transformation often has to be done. Thus, to address this issue, in this paper we investigate the problem of automatically verifying and synthesizing reductions, the solution of which may allow an automatic linearization of nonlinear models. We show that the synthesis of reductions can be formulated as an $\exists^* \forall^*$ synthesis problem, which can be solved by an SMT solver via the counter-example guided inductive synthesis approach (CEGIS).<|reference_end|>
@article{cao2024towards,
    title={Towards Automatic Linearization via SMT Solving},
    author={Jian Cao, Liyong Lin, Lele Li},
    journal={arXiv preprint arXiv:2408.13487},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.13487},
    primaryClass={cs.LO cs.SY eess.SY math.OC}
}