Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.
David Atienza Alonso, Giovanni Ansaloni, Grégoire Axel Eggermann, Marco Antonio Rios