For the fast approximate solution of Mixed-Integer Non-Linear Programs (MINLPs) arising in the context of Mixed-Integer Optimal Control Problems (MIOCPs) a decomposition algorithm exists that solves a sequence of three comparatively less hard subproblems to determine an approximate MINLP solution. In this work, we propose a problem formulation for the second algorithm stage that is a convex approximation of the original MINLP and relies on the Gauss–Newton approximation. We analyze the algorithm in terms of approximation properties and establish a first-order consistency result. Then, we investigate the proposed approach considering a numerical case study of Mixed-Integer Optimal Control (MIOC) of a renewable energy system. The investigation shows that the proposed formulation can yield an improved integer solution regarding the objective of the original MINLP compared with the established Combinatorial Integral Approximation (CIA) algorithm.

## Citation

Automatica 152, 110967, 2023. DOI 10.1016/j.automatica.2023.110967