1. Chin C.M. and Fletcher R. (2001), On the Global Convergence of an SLP-filter algorithm that takes EQP steps, Dundee University, Dept. of Mathematics, Report NA/199.
2. Fletcher R. and Leyffer S. (1997), Nonlinear Programming Without a Penalty Function, Dundee University, Dept. of Mathematics, Report NA/171, to appear in Mathematical Programming.
3. Fletcher R., Leyffer S. and Toint Ph.L. (2000), On the Global Convergence of a Filter-SQP Algorithm, Dundee University, Dept. of Mathematics, Report NA/197, to appear in SIAM Journal of Optimization.
4. Gauvin J. (1977), A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming, Mathematical Programming, 12, pp. 136–138.
5. Powell M.J.D. (1970), A hybrid method for nonlinear equations, in Numerical Methods for Nonlinear Algebraic Equations, (Ed. P. Rabinowitz), Gordon and Breach, London.