Infoscience

Journal article

On extremal behaviors of Murty's least index method

In this small note, we observe some extremal behaviors of Murty's least index method for solving linear complementarity problems. In particular, we show that the expected number of steps for solving Murty's exponential example with a random permutation of variable indices is exactly equal to n, where n is the size of the input square matrix.

    Note:

    PRO 94.09

    Reference

    • ROSO-ARTICLE-1994-004

    Record created on 2006-02-13, modified on 2016-08-08

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material