Abstract We present an accelerator scheme for use with existing packages that solve nonlinear programming problems with a large number of inequality constraints that arise in the process of discretizing continuous-time optimal control problems with state-space constraints. This scheme is based on the concept of outer approximations used in semi-infinite programming and acts as an external , active constraints set strategy. Our scheme constructs a finite sequence of inequality constrained nonlinear programming problems, containing a progressively larger subset of the constraints in the original problem, and submits these problems to a nonlinear programming solver for a fixed number of iterations. We prove that this scheme computes a solution of the original problem and show, by means of numerical experiments, that it results in reductions in computing time ranging from a factor of 6 to a factor of over 400.
[1]
Elijah Polak,et al.
Optimization: Algorithms and Consistent Approximations
,
1997
.
[2]
P. Gill,et al.
User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming.
,
1983
.
[3]
E. Polak,et al.
An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax Problems
,
2008
.
[4]
Jorge Nocedal,et al.
Knitro: An Integrated Package for Nonlinear Optimization
,
2006
.
[5]
Michael A. Saunders,et al.
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
,
2002,
SIAM J. Optim..