Semi-infinite programming, duality, discretization and optimality conditions†

Alexander Shapiro · Optimization · 2009

The aim of this article is to give a survey of some basic theory of semi-infinite programming. In particular, we discuss various approaches to derivations of duality, discretization, and first- and second-order optimality conditions. Some of the surveyed results are well known while others seem to be less noticed in that area of research.

Read the paper · More papers on PaperTik