We propose a numerical algorithm for solving smooth nonlinear programming problems with a large number of constraints, but a moderate number of variables. The active set method proceeds from a given bound mw for the maximum number of expected violated constraints, where mw is a user-provided parameter less than the total number of constraints. A quadratic programming subproblem is generated with mw linear constraints, the so-called working set, which are internally exchanged from one iterate to the next. Only for active constraints, i.e., a certain subset of the working set, new gradient values must be computed. The line search takes the active constraints into account. Numerical results for some simple academic test problems show that nonlinear programs with up to 200,000,000 nonlinear constraints can be efficiently solved on a standard PC.
Report, Department of Computer Science, University of Bayreuth, 95440 Bayreuth, Germany, 7/2008