McCormick relaxations for PDE-constrained optimization on multi-dimensional domains

RESUMO

We are interested in computing approximate dual bounds for nonconvex optimal control problems using McCormick inequalities. To handle the numerical burden concerned with the tightening of these inequalities, we locally average the bilinear term in the PDE constraint. We extend recent theory in this area to elliptic PDEs on multidimensional domains that involve bilinear terms. As an additional result, we also generalize the necessary assumptions to allow for more flexibility in the choice of the discretization for the total variation penalty term from the underlying control problem. Furthermore, we prove the existence of valid bounds on the state variable, which are crucial to enable the optimization-based bound-tightening (OBBT) procedure to tighten the McCormick inequalities. Since theoretical bounds on the state variable are rather conservative, OBBT is both crucial and the main computational bottleneck for deriving a sharp approximate dual bound. We show how the sequence of LPs arising during OBBT may sensibly be warmstarted, allowing us to successfully scale the numerical experiments to finer discretizations than what was possible before.