1 paper
Milad Dehghani Filabadi, Chen Chen
Signomial geometric programming (SGP) is a computationally challenging, NP-Hard class of nonconvex nonlinear optimization problems. SGP can be solved iteratively using a sequence o…