-
Nonconvergence of the plain Newton-min algorithm for linear complementarity p...
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... -
An algorithmic characterization of P-matricity
International audience
