collaborators

1 paper

math.OC2019

Convexification of box-constrained polynomial optimization problems via monomial patterns

Gennadiy Averkov, Benjamin Peters, Sebastian Sager

Convexification is a core technique in global polynomial optimization. Currently, there are two main approaches competing in theory and practice: the approach of nonlinear programm…