In this paper, we propose an algorithm for solving nonlinear nonconvex programming problems, which is based on the interior-point approach. Main theoretical results concern direction determination and step-length selection. We split inequality constraints into active and inactive to overcome problems with stability. Inactive constraints are eliminated directly while active constraints are used to define symmetric indefinite linear system. Inexact solution of this system is obtained iteratively using indefinitely preconditioned conjugate gradient method. Theorems confirming efficiency of several indefinite preconditioners are proved. Furthermore, new merit function is defined, which includes effect of possible regularization. This regularization can be used to overcome problems with near linear dependence of active constraints. The algorithm was implemented in the interactive system for universal functional optimization UFO. Results of extensive numerical experiments are reported.
Report V836, Institute of Computer Science, AV CR, Pod Vodarenskou Vezi 2, 18207 Praha 8, Czech Republic. Last revision: November 2002.
View Interior-Point Method for Nonlinear Nonconvex Optimization