Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

An algorithmic characterization of P-matricity II: adjustments, refinements, and validation

Abstract : The paper "An algorithmic characterization of P-matricity" (SIAM Journal on Matrix Analysis and Applications, 34:3 (2013) 904–916, by the same authors as here) implicitly assumes that the iterates generated by the Newton-min algorithm for solving a linear complementarity problem of dimension n, which reads 0 ⩽ x ⊥ (M x + q) ⩾ 0, are uniquely determined by some index subsets of [[1, n]]. Even if this is satisfied for a subset of vectors q that is dense in R^n, this assumption is improper, in particular in the statements where the vector q is not subject to restrictions. The goal of the present contribution is to show that, despite this blunder, the main result of that paper is preserved. This one claims that a nondegenerate matrix M is a P-matrix if and only if the Newton-min algorithm does not cycle between two distinct points, whatever is q. The proof is not more complex, requiring only some adjustments, which are essential however.
Document type :
Journal articles
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download
Contributor : Jean Charles Gilbert Connect in order to contact the contributor
Submitted on : Thursday, April 11, 2019 - 2:02:19 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:03 PM


Files produced by the author(s)




Ibtihel Ben Gharbia, Jean Charles Gilbert. An algorithmic characterization of P-matricity II: adjustments, refinements, and validation. SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩. ⟨hal-01672197v4⟩



Record views


Files downloads