McCormick envelopes in mixed-integer PDE-constrained optimization
McCormick envelopes in mixed-integer PDE-constrained optimization
McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. McCormick envelopes provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in infinite-dimensional optimization so far. This lack of attention may be due to …