- An algorithmic characterization of P-matricity Ibtihel Ben Gharbia (ibtihel.ben-gharbiainria.fr) Jean Charles Gilbert (Jean-Charles.Gilbertinria.fr) 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\leq x\perp (Mx+q)\geq0$. Keywords: linear complementarity problem, semismooth Newton method, Newton-min algorithm, NM-matrix, P-matrix Category 1: Complementarity and Variational Inequalities Citation: Inria research report RR-8004 Download: [PDF]Entry Submitted: 06/29/2012Entry Accepted: 06/29/2012Entry Last Modified: 02/15/2013Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.