No abstract

No abstract

No abstract

A globally convergent algorithm is presented for the solution of a wide class of semi-infinite programming problems. The method is based on the solution of a sequence of equality constrained quadratic programming problems, and usually has a second order convergence rate. Numerical results illustrating the effectiveness of the method are given.

An algorithm for nonlinear minimax approximation is described, and shown to be convergent under conditions which are often assumed in practice. The algorithm is illustrated by the calculation of several approximations to the solution of the Biasius equation.