Minimum principles and error bounds for monotone linear complementarity problems (II)

Minimum principles and error bounds for monotone linear complementarity problems (II)

0.00 Avg rating0 Votes
Article ID: iaor20001119
Country: China
Volume: 15
Issue: 4
Start Page Number: 339
End Page Number: 346
Publication Date: Nov 1995
Journal: Journal of Systems Science and Complexity
Authors: , ,
Keywords: complementarity
Abstract:

Another type of minimum principle is presented for a monotone linear complementarity problem (MLCP) based on Ferris and Mangasarian and a new algorithm is proposed to find all the solutions of an MLCP in a finite number of steps. Three error bound results are given, which are refinements and extensions of the corresponding results by Mangasarian and Mangasarian and Shiau.

Reviews

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