Dual form reduction in the atomic optimization method

详细

One-dimensional optimization problems with a polynomial objective function and polynomial matrix inequality constraints are considered. For problems dual to their linear relaxations, a transformation is presented that makes them compatible with the atomic optimization method, both in its basic and in the generalized form with a reduced number of atoms.