Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Paper
On the convergence of the block principal pivotal algorithm for the LCP
Abstract
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.
Related
Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004