(en) W. Morris, « Randomized pivot algorithms for P-matrix linear complementarity problems », Mathematical Programming, vol. 92A, , p. 285–296 (DOI10.1007/s101070100268)
(en) G. E. Coxson, « The P-matrix problem is co-NP-complete », Mathematical Programming, vol. 64, , p. 173–178 (DOI10.1007/BF01582570)
(en) I. Ben Gharbia, J.Ch. Gilbert (2012). Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix. Mathematical Programming, 134, 349-364. doi lien Zentralblatt MATH
(en) I. Ben Gharbia, J.Ch. Gilbert (2012). Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix. Mathematical Programming, 134, 349-364. doi lien Zentralblatt MATH