Quasi-Newton methods in conjunction with the piecewise sequential quadratic programming are investigated for solving mathematical programming with equilibrium constraints, in particular for problems with complementarity constraints. Local convergence as well as superlinear convergence of these quasi-Newton methods can be established under suitable assumptions. In particular, several well-known quasi-Newton methods such as BFGS and DFP are proved to exhibit the local and superlinear convergence.
Unpublished. Judge Institute of Management, Cambridge University, Trumpington St, Cambridge, CB2 1AG, UK, 2002.
View Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints