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