Journal of Mathematical Sciences: Advances and Applications[1] M. Fukushima, Z. Q. Luo and J. S. Pang, A globally convergent
sequential quadratic programming algorithm for mathematical
programming with linear complementarity constraints, Computational
Optimization and Applications 10 (1998), 5-34.
[2] Z. Q. Luo, J. S. Pang, D. Ralph and S. Q. Wu, Exact penalization
and stationarity conditions of mathematical programs with equilibrium
constraints, Mathematical Programming 75 (1996), 19-76.
[3] J. Outrata, M. Kocvare and J. Zowe, Nonsmooth approach to
optimization problems with equilibrium constrains, Kluwer Academic
Publishers, Netherlands, 1998.
[4] E. R. Panier, A. L. Tits and J. N. Herskovits, A superlinearly
convergent feasible method for solution of inequality constrained
optimization problems, SIAM Journal on Control and Optimization 25
(1987), 934-950.
[5] Zhen Jun Shi, A class of global convergent conjugate projection
gradient method and its superlinear convergence rate, Mathematica
Numerica Sinica 18(4) (1996), 411-421.
[6] Zhibin Zhu and Zhang Kecun, A superlinearly convergent SQP
algorithm for mathematical programs with linear complementarity
constraints, Applied Mathematics and Computation 172 (2006), 222-244.
