On the numerical feasibility of continuation methods for nonlinear programming problems

In the present paper the radius of convergence of a class of locally convergent nonlinear programming algorithms (containing Robinson's and Wilson's methods) applied to a parametric nonlinear programming problem is estimated. A consequence is the numerical feasibility of globalizations of Robinson's and Wilson's methods by means of continuation techniques.