A simplex algorithm for rational cp-factorization
Optimization and Control
2021-04-27 v4 Number Theory
Abstract
In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization. This algorithm can be used to show that every integral completely positive matrix has an integral cp-factorization.
Cite
@article{arxiv.1807.01382,
title = {A simplex algorithm for rational cp-factorization},
author = {Mathieu Dutour Sikirić and Achill Schürmann and Frank Vallentin},
journal= {arXiv preprint arXiv:1807.01382},
year = {2021}
}
Comments
(v4) 18 pages, some small corrections, to appear in Mathematical Programming