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.
Type de document :
[Research Report] RR-2445, INRIA. 1994
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:49:33
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:31:01



  • 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〉



Consultations de la notice


Téléchargements de fichiers