Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995)

The authors introduce a new dual program, which is representable as a semidefinite linear programming problem, for a primal convex minimax programming problem. They show that there is no duality gap between the primal and the dual whenever the functions involved are sum-of-squares convex polynomials. The strong duality results for this class of minimax problems are derived under a suitable constraint qualification.