Finiteness of criss-cross method in complementarity problem

Document Type

Conference Article

Publication Title

Communications in Computer and Information Science

Abstract

In this paper we consider criss-cross method for finding solution of a linear complementarity problem. The criss-cross method is a pivoting procedure. We show that the criss-cross method is able to compute solution of a linear complementarity problem in finite steps in case of some new matrix classes. We present a numerical illustration to show a comparison between criss-cross method and Lemke’s algorithm with respect to number of iterations before finding a solution. Finally we raise an open problem in the context of criss-cross method.

First Page

170

Last Page

180

DOI

10.1007/978-981-10-4642-1_15

Publication Date

1-1-2017

This document is currently not available here.

Share

COinS