collaborators

1 paper

math.OC2025

Convex semi-infinite programming algorithms with inexact separation oracles

Antoine Oustry, Martina Cerulli

Solving convex Semi-Infinite Programming (SIP) problems is challenging when the separation problem, i.e., the problem of finding the most violated constraint, is computationally ha…