From the abstract
But some transformation and convexification strategies can be used to convert the original signomial geometric programming problem into a series of standard geometric programming problems that can be solved to reach a global solution.
Apparently, this is one of several papers over the years which present algorithms which (attempt to) solve the global optimization problem for Signomial GP or other generalized geometric programs by solving a sequence of convex optimization problems.
If these convex optimization problems can be formulated consistent with CVX’s rules, then CVX could be called to solve individual convex problems within the context of a higher level algorithm. I think discussion of how to implement such an algorithm, focusing on the formulation and solution of the convex problems for CVX, could be on-topic for the board.
However, this is not the appropriate forum to ask questions about GGPLAB.