Corrigendum: Nonlinear programming without
                   a penalty function or a filter

        N. I. M. Gould, D. P. Robinson and Ph. L. Toint

               Report NAXYS-07-2011   10 February 2011

Abstract.

This  report  presents a  corrected  convergence  proof  for the  trust-funnel
algorithm introduced in  [1].  In this reference, a  new method was introduced
for solving equality constrained nonlinear optimization problems.  This method
does not  use a penalty function,  nor a filter, and  yet can be  proved to be
globally  convergent  to  first-order  stationary points.  It  uses  different
trust-regions to  cope with the  nonlinearity of the objective  and constraint
functions,  and allows  inexact  SQP steps  that  do not  lie  exactly in  the
nullspace of  the local Jacobian.  Preliminary numerical experiments  on CUTEr
problems indicate that the method performs well.

[1] N. I. M. Gould and Ph. L. Toint, 
    ``Nonlinear programming without a penalty function or a filter'',
    Mathematical Programming A, vol. 122(1), pp. 155-196, 2010.