Atomic optimization, part 2: multidimensional problems and polynomial matrix inequalities
We investigate multidimensional optimization problems with polynomial objective function and polynomial matrix inequality constraints and suggest a transformation of the moment-theory-based solution technique. It allows reducing significantly the computational complexity while keeping the ability to solve the problems of the class under consideration.