Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

For nonlinear programming problems which are factorable, a computable procedure for obtaining tight underestimating convex programs is presented. This is used to exclude from consideration regions where the global minimizer cannot exist.