Polynomial programming using multi-homogeneous polynomial continuation (Q1195745)

In this note a polynomial programming problem of the type \(\min_ x\{\theta(x)\mid\) \(h(x)=0\}\), where \(\theta\), \(h\) are polynomial functions \(\theta: E^ n\to E\), \(h: E^ n\to E^ q\), is considered. Traditional constructions of the polynomial continuation approach need the computation of the complete list of geometrically isolated solutions of the first order optimality conditions (1) \(\nabla\theta(x)+r^ t\nabla h(x)=0\), \(h(x)=0\). In this note the variables \(x\) are partitioned into \(m\) nonempty sets and new variables are created in such a way that the new system generated from (1) will be homogeneous. This homogenization gives a possibility to reduce the number of paths needed to solve the problem.