No label defined (Q3330405)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3862340
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3862340

      Statements

      0 references
      0 references
      1983
      0 references
      starting point
      0 references
      variable dimension restart algorithms
      0 references
      linear complementarity problem
      0 references
      convergence
      0 references
      [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.
      0 references

      Identifiers