Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Année : 2012

Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix

Résumé

The plain Newton-min algorithm to solve the linear complementarity problem (LCP for short) 0 ≤ x ⊥ (Mx+q) ≥ 0 can be viewed as a nonsmooth Newton algorithm without globalization technique to solve the system of piecewise linear equations min(x,Mx+q)=0, which is equivalent to the LCP. When M is an M-matrix of order n, the algorithm is known to converge in at most n iterations. We show in this paper that this result no longer holds when M is a P-matrix of order ≥ 3, since then the algorithm may cycle. P-matrices are interesting since they are those ensuring the existence and uniqueness of the solution to the LCP for an arbitrary q. Incidentally, convergence occurs for a P-matrix of order 1 or 2.
Fichier principal
Vignette du fichier
bengharbia-gilbert-2012.pdf (413.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY NC ND - Paternité - Pas d'utilisation commerciale - Pas de modification

Dates et versions

hal-04148354 , version 1 (02-07-2023)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

Ibtihel Ben Gharbia, Jean Charles Gilbert. Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix. Mathematical Programming, 2012, 134, pp.349-364. ⟨10.1007/s10107-010-0439-6⟩. ⟨hal-04148354⟩

Collections

INRIA INRIA2
0 Consultations
5 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More