# Improved Regularity Assumptions for Partial Outer Convexification of Mixed-Integer PDE-Constrained Optimization problems

Partial outer convexification is a relaxation technique for MIOCPs being constrained by time-dependent differential equations. Sum-Up-Rounding algorithms allow to approximate feasible points of the relaxed, convexified continuous problem with binary ones that are feasible up to an arbitrarily small $\delta > 0$. We show that this approximation property holds for ODEs and semilinear PDEs under mild regularity assumptions on the nonlinearity and the solution trajectory of the PDE. In particular, requirements of differentiability and uniformly bounded derivatives on the involved functions from previous work are not necessary to show convergence of the method.