Efficient Computation of a Canonical Form for a Generalized P-matrix
Optimization and Control
2012-05-01 v1
Abstract
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
Cite
@article{arxiv.1204.6345,
title = {Efficient Computation of a Canonical Form for a Generalized P-matrix},
author = {Walter D. Morris},
journal= {arXiv preprint arXiv:1204.6345},
year = {2012}
}