One-dimensional problems arise in both primal and dual signomial programs. Primal problems are of interest since many multidimensional search procedures involve one-dimensional searches. Dual problems occur naturally since many engineering design problems can be expressed as signomial programs with a single degree of difficulty. This paper applies an interval arithmetic version of Newton's method to one-dimensional unconstrained problems in signomial programming. The interval arithmetic method is guaranteed to generate all the stationary points.
/lp/association-for-computing-machinery/one-dimensional-problems-in-unconstrained-signomial-programming-an-HTIpIZZP0y