An infeasible interior-point method with nonmonotonic complementarity gaps
This article describes an infeasible interior-point (IP) method for solving monotone variational inequality problems with polyhedral constraints and, as a particular case, monotone nonlinear complementarity problems. The method determines a search direction by solving, possibly in an inexact way, the Newton equation for the central path. Then, a curvilinear search is used to meet classical centering conditions and an Armijo rule. The novelty with respect to classical IP methods consists in relaxing the requirement of monotonic decrease in the complementarity gaps. Global convergence results are proved and numerical experiments are presented. The experiments confirm the effectiveness of nonmonotonicity in a number of test problems.
complementarity gap variational inequalities complementarity problems infeasible interior-point algorithms nonmonotonic algorithms