On quadratically convergent methods for semi-infinite programming

A class of methods for solving general nonlinear semi-infinite programming problems is considered which may be shown to converge superlinearly to a solution, if for this solution a sufficient second order optimality condition holds. An important feature of all these methods is that they are related to the treatment of a finite programming problem. In the last two sections generalizations of "approximation methods" from nonlinear programming to the semi-infinite case are considered.