Sum-of-squares relaxations for polynomial min-max problems over simple sets

arXiv2306.14607MaRDI QIDQ6441503FDOQ6441503

Authors: Francis Bach 

Publication date: 26 June 2023

Abstract: We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables. When the variables belong to simple sets (e.g., a hypercube, the Euclidean hypersphere, or a ball), we derive a sum-of-squares formulation based on a primal-dual approach. In the simplest setting, we provide a convergence proof when the degree of the relaxation tends to infinity and observe empirically that it can be finitely convergent in several situations. Moreover, our formulation leads to an interesting link with feasibility certificates for polynomial inequalities based on Putinar's Positivstellensatz.

This page was built for publication: Sum-of-squares relaxations for polynomial min-max problems over simple sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441503)