Mathematical Programming Computation Теоретическая информатика

Polynomial optimization relaxations for generalized semi-infinite programs

Xiaomeng Hu, Jiawang Nie
Springer Nature · 2025-04-18 · DOI 10.1007/s12532-025-00280-4

Аннотация

Abstract This paper studies generalized semi-infinite programs (GSIPs) given by polynomials. We propose a hierarchy of polynomial optimization relaxations to solve them. They are based on Lagrange multiplier expressions and polynomial extensions. Moment-SOS relaxations are applied to solve the polynomial optimization. The convergence of this hierarchy is shown under certain conditions. In particular, the classical semi-infinite programs can be solved as a special case of GSIPs. We also study GSIPs that have convex infinity constraints and show that they can be solved exactly by a single polynomial optimization relaxation. The computational efficiency is demonstrated by extensive numerical results.

Читать у издателя →