Traditional deterministic global optimization methods are often based on a Branch-and-Bound (BB) search tree, which may grow rapidly, preventing the method to find a good solution. Motivated by decomposition-based inner approximation (column generation) methods for solving transport scheduling problems with over 100 million variables, we present a new deterministic decomposition-based successive approximation method for general modular and/or sparse MINLPs. The new method, called Decomposition-based Inner- and Outer-Refinement, is based on a block-separable reformulation of the model into sub-models. It generates inner- and outer-approximations using column generation, which are successively refined by solving many easier MINLP and MIP subproblems in parallel (using BB), instead of searching over one (global) BB search tree. We present preliminary numerical results with Decogo (Decomposition-based Global Optimizer), a new parallel decomposition MINLP solver implemented in Python and Pyomo.
- Global optimization
- Decomposition method
- Successive approximation
- Column generation
Nowak, I., Breitfeld, N., Hendrix, E. M. T., & Njacheun-Njanzoua, G. (2018). Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization. Journal of Global Optimization, 72(2), 305-321. https://doi.org/10.1007/s10898-018-0633-2