Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
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.
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Qing Li, Zhigang Deng, et al.
IEEE T-MI