A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps

<div>Comparison between our method with the method of El foutayeni, the method of Yu, and the method of CHKS as a function of time and number of iterations in the case where <span class="nowrap"><svg height="8.55521pt" id="M449" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.34882 27.8368 8.55521" width="27.8368pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M495 86L479 114C446 82 419 66 409 66C401 66 401 72 406 97C420 166 436 231 453 297C489 435 454 448 428 448C406 448 384 439 354 422C305 394 222 327 161 247H159L183 345C200 415 194 448 173 448C143 448 82 410 23 351L38 325C64 349 95 371 105 371C111 371 116 365 109 336L25 -4L31 -12C50 -4 77 3 107 9C119 69 132 122 145 168C197 254 321 381 370 381C387 381 393 374 378 305L329 95C309 17 320 -12 345 -12C372 -12 430 19 495 86Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.158,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.421,0)"><path d="M456 178V225H360V632H320C217 496 115 347 20 206V178H280V106C280 40 276 34 189 27V0H445V27C364 34 360 39 360 106V178H456ZM280 225H82C149 335 214 431 278 520H280V225Z"></path></g></svg>.</span></div>

Abstract and Applied Analysis

fig1

Figure 1

Figure 1: A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps 