Skip to Main content Skip to Navigation

Infeasible path following algorithms for linear complementarity problems

Abstract : A generalized class of infeasible-interior-point methods for solving horizontal linear complementarity problem is analyzed and sufficient conditions are given for the convergence of the sequence of iterates produced by methods in this class. In particular it is shown that the largest step path following algorithms generates convergent iterates even when starting from infeasible points. The computational complexity of the latter method is discussed in detail and its local convergent rate is analyzed. The primal-dual gap of the iterates produced by this method is superlinearly convergent to zero. A variant of the method has quadratic convergence.
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:49:33 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 9:31:01 PM


  • HAL Id : inria-00074230, version 1



J. Frederic Bonnans, Florian A. Potra. Infeasible path following algorithms for linear complementarity problems. [Research Report] RR-2445, INRIA. 1994. ⟨inria-00074230⟩



Record views


Files downloads