Numerical Experiments with Globally Convergent Methods for Semi-Infinite Programming Problems

To date, the main emphasis in the development of numerical methods for solving semi-infinite programming problems has been on producing good locally convergent methods, and it seems that little attention has been given to the provision of globally convergent algorithms, except in some special cases. For many finite programming problems, good globally convergent methods based on the use of exact penalty functions are now available and it is the purpose of this paper to show that precisely analogous methods may be successfully used for a general class of semi-infinite programming problems.