A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem
Optimization and Control
2011-12-02 v1 Computational Complexity
Abstract
We give a polynomial-time dynamic programming algorithm for solving the linear complementarity problem with tridiagonal or, more generally, Hessenberg P-matrices. We briefly review three known tractable matrix classes and show that none of them contains all tridiagonal P-matrices.
Cite
@article{arxiv.1112.0217,
title = {A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem},
author = {Bernd Gärtner and Markus Sprecher},
journal= {arXiv preprint arXiv:1112.0217},
year = {2011}
}
Comments
4 pages, 3 figures