A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point

A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point

0.00 Avg rating0 Votes
Article ID: iaor19951889
Country: Netherlands
Volume: 63
Issue: 2
Start Page Number: 235
End Page Number: 252
Publication Date: Jan 1994
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: linear complementarity
Abstract:

The linear complementarity problem is to find nonnegative vectors which are affinely related and complementary. In this paper the authors propose a new complementary pivoting algorithm for solving the linear complementarity problem as a more efficient alternative to the algorithms proposed by Lemke and by Talman and Van der Heyden. The algorithm can start at an arbitrary nonnegative vector and converges under the same conditions as Lemke’s algorithm.

Reviews

Required fields are marked *. Your email address will not be published.