No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

In this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper-and the lower-level problems are polynomials. We present methods for finding its global minimizers and global minimum using a sequence of semidefinite programming (SDP) relaxations and provide convergence results for the methods. Our scheme for problems with a convex lower-level problem involves solving a transformed equivalent single-level problem by a sequence of SDP relaxations, whereas our approach for general problems involving a nonconvex polynomial lower-level problem solves a sequence of approximation problems via another sequence of SDP relaxations.

Let n be an integer such that 25≤n≤51. We construct a smooth metric g on Sn with the property that the set of constant scalar curvature metrics in the conformal class of g is not compact.