![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Sequential quadratic programming (SQP) methods have been extensively studied to handle nonlinear programming problems. In this paper, a new SQP approach is employed to tackle nonlinear complementarity problems (NCPs). At each iterate, NCP conditions are divided into two parts. The inequalities and equations in NCP conditions, which are violated in the current iterate, are treated as the objective function, and the others act as constraints, which avoids finding a feasible initial point and feasible iterate points. NCP conditions are consequently transformed into a feasible nonlinear programming subproblem at each step. New SQP techniques are therefore successful in handling NCPs.
Acknowledgements
This work is supported by the National Natural Science Foundation of China (No. 10501019), the New Century Excellent Talents in University(NCET), the State Education Ministry and the China Postdoctoral Science Foundation (No. 20060400875). It is also partly supported by the Second Phase Construction Item of Hunan University and the Base for Economic Globalization and Development of Trade Philosophical Social Sciences.