2 papers
math.OC2024
Exponential Conic Relaxations for Signomial Geometric Programming
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…
math.OC2017
A Spatial Branch-and-Cut Method for Nonconvex QCQP with Bounded Complex Variables
Chen Chen, Alper Atamturk, Shmuel S. Oren
We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added…