Leo Liberti, James Ostrowski
Journal of Global Optimization
Our interest lies in solving sum of squares (SOS) relaxations of large-scale unconstrained polynomial optimization problems. Because interior-point methods for solving these problems are severely limited by the large-scale, we are motivated to explore efficient implementations of an accelerated first-order method to solve this class of problems. By exploiting special structural properties of this problem class, we greatly reduce the computational cost of the first-order method at each iteration. We report promising computational results as well as a curious observation about the behaviour of the first-order method for the SOS relaxations of the unconstrained polynomial optimization problem. © 2013 Copyright Taylor and Francis Group, LLC.
Leo Liberti, James Ostrowski
Journal of Global Optimization
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Shu Tezuka
WSC 1991