Infeasible path following algorithms for linear complementarity problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Infeasible path following algorithms for linear complementarity problems

J. Frederic Bonnans
  • Function : Author
  • PersonId : 833418
  • IdHAL : bonnans
Florian A. Potra
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-2445.pdf (339.38 Ko) Télécharger le fichier

Dates and versions

inria-00074230 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074230 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More