On the Convergence of an Iterative Method for Solving Linear Complementarity Problem with WGPSBD Matrix

A. K. Das, R. Jana, Deepmala -

Abstract


In this paper we propose an iterative and descent type interior point method to compute solution of linear complementarity problem LCP($q,A$)  given that $A$ is real square matrix and $q$ is a real vector. The linear complementarity problem includes many of the optimization problems and applications. In this context we consider the class of weak generalized positive subdefinite matrices (WGPSBD) which is a generalization of the class of generalized positive subdefinite (GPSBD) matrices. Though Lemke's algorithm is frequently used to solve small and medium size LCP($q,A$), Lemke's algorithm does not compute solution of all problems. It is known that Lemke's algorithm is not a polynomial time bound algorithm. We show that the proposed algorithm converges to the solution of LCP($q,A$) where $A$ belongs to WGPSBD class. A numerical example is illustrated to show the performance of the proposed algorithm.

Refbacks

  • There are currently no refbacks.


The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|