In this report, we propose an algorithm for solving nonlinear programming problems with com-plementarity constraints, which is based on the interior-point approach. Main theoretical results concern direction determination and step-length selection. We use an exact penalty function to remove complementarity constraints. Thus a new indefinite linear system is defined with a tridiagonal low-right submatrix. Inexact solution of this system is obtained iteratively using indefinitely preconditioned conjugate gradient method. Furthermore, new merit function is defined, which includes barrier, exact penalty, and augmented Lagrangian terms. The algorithm was implemented in the interactive system for universal functional optimization UFO. Results of extensive numerical experiments are reported.
Technical report No. 1039, Institute of Computer Sciencer, Pod Vodarenskou Vezi 2, 18207 Praha 8, December 2008.
View Interior-point method for nonlinear programming with complementarity constraints