Plan is develop this in the following steps:

At the edge of the GGV envelope if:

Therefore, at the edge of the GGV envelope when the minimum of:

equals 0 → so a root finding algorithm can be used which should be faster than a general minimisation algorithm (unless there’s a possibility for weird edge cases)

PointMass