An Algorithmic Characterization of $P$-Matricity
DOI10.1137/120883025zbMath1281.65088OpenAlexW2085202100MaRDI QIDQ2866216
No author found.
Publication date: 13 December 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120883025
linear complementarity problemsemismooth Newton methodNewton-min algorithm\(\mathbf {NM}\)-matrix\(\mathbf P\)-matricity characterization\(\mathbf P\)-matrix
Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (10)
This page was built for publication: An Algorithmic Characterization of $P$-Matricity