×

A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. (English) Zbl 0904.90153

Summary: This paper presents a sequential quadratic programming algorithm for computing a stationary point of a mathematical program with linear complementarity constraints. The algorithm is based on a reformulation of the complementarity condition as a system of semismooth equations by means of Fischer-Burmeister functional, combined with a classical penalty function method for solving constrained optimization problems. Global convergence of the algorithm is established under appropriate assumptions. Some preliminary computational results are reported.

MSC:

90C30 Nonlinear programming
PDFBibTeX XMLCite
Full Text: DOI