An algorithmic characterization of P-matricity

Abstract : It is shown that a matrix M is a P-matrix if and only if, whatever is the vector q, the Newton-min algorithm does not cycle between two points when it is used to solve the linear complementarity problem 0 ≤ x ⊥ (Mx+q) ≥ 0.
Document type :
Journal articles
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-00713330
Contributor : Jean Charles Gilbert <>
Submitted on : Friday, February 15, 2013 - 7:10:43 PM
Last modification on : Friday, April 19, 2019 - 3:25:21 PM
Long-term archiving on : Thursday, May 16, 2013 - 4:03:20 AM

File

RR-8004.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Ibtihel Ben Gharbia, Jean Charles Gilbert. An algorithmic characterization of P-matricity. SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2013, 34, pp.904-916. ⟨10.1137/120883025⟩. ⟨hal-00713330v2⟩

Share

Metrics

Record views

710

Files downloads

431