Abstract
AbstractIn this paper, a primal–dual interior point QP-free algorithm for mathematical programs with complementarity constraints is presented. Firstly, based on Fischer–Burmeister function and smoothing techniques, the investigated problem is approximated by a smooth nonlinear constrained optimization problem. Secondly, combining with an effective penalty function technique and working set, a QP-free algorithm is proposed to solve the smooth constrained optimization problem. At each iteration, only two reduced linear equations with the same coefficient matrix are solved to obtain the search direction. Under some mild conditions, the proposed algorithm possesses global convergence. Finally, some numerical results are reported.
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference35 articles.
1. Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39, 669–713 (1997)
2. Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)
3. Nonconvex Optimization and Its Applications;M. Kocvara,1998
4. Nonconvex Optimization and Its Applications;S. Dempe,2002
5. Fukushima, M.: A successive quadratic programming algorithm with global and superlinear convergence properties. Math. Program. 35, 253–264 (1986)