scientific article; zbMATH DE number 3862340

From MaRDI portal
Publication:3330405





[For the entire collection see Zbl 0507.00009.] Recently, Van der Laan and the first author (1979, 1981) proposed a class of variable dimension restart algorithms for approximating fixed points. These methods allow a start at an arbitrary point. The present paper shows that such ideas can be used to construct an interesting class of algorithms for the linear complementarity problem. Flexibility in the choice of the starting point is desirable, e.g. when solving nonlinear complementarity problems via a succession of approximating linear problems. Some convergence results for the algorithms are given which include known classes of Q-matrices.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330405)