Numerical methods for semi-infinite programming: a survey

This paper provides a review of numerical methods for the solution of smooth semiinfinite programming problems. Fundamental and partly new results on level sets, discretization, and local reduction are presented in a primary section. References to algorithms for real and complex continuous Chebyshev approximation are given for historical reasons and in order to point out connections. (orig.)Available from TIB Hannover: RR 7760(1998,2) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman