| Article ID: | iaor20171895 |
| Volume: | 78 |
| Issue: | 5 |
| Start Page Number: | 940 |
| End Page Number: | 952 |
| Publication Date: | May 2017 |
| Journal: | Automation and Remote Control |
| Authors: | Pozdyayev V |
| Keywords: | heuristics |
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.