Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
We show that the block principal pivot algorithm (BPPA) for the linear complementarity problem (LCP) solves the problem for a special class of matrices in at most n block principal pivot steps. We provide cycling examples for the BPPA in which the matrix is positive definite or symmetric positive definite. For LCP of order three, we prove that strict column (row) diagonal dominance is a sufficient condition to avoid cycling. © 1997 Elsevier Science B.V.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Robert C. Durbeck
IEEE TACON
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science