A general framework for convexity analysis in deterministic global optimization

In previous work, we, and also Epperly and Pistikopoulos, proposed an analysis of general nonlinear programs that identified certain variables as convex, not ever needing subdivision, and non‐convex, or possibly needing subdivision in branch and bound algorithms. We proposed a specific algorithm, based on a generated computational graph of the problem, for identifying such variables. In our previous work, we identified only independent variables in the computational graph. Here, we examine alternative sets of non‐convex variables consisting not just of independent variables, but of a possibly smaller number of intermediate variables. We do so with examples and theorems. We also apply variants of our proposed analysis to the well‐known COCONUT Lib‐1 test set. If the number of such non‐convex variables is sufficiently small, it may be possible to fully subdivide them before analysis of ranges of objective and constraints, thus dispensing totally with the branch and bound process. Advantages to such a non‐adaptive process include higher predictability and easier parallizability. We present an algorithm and exploratory results here, with a more complete empirical study in a subsequent paper.