Rational factorizations of completely positive matrices. (English) Zbl 1369.90121
Summary: In this note it is proved that every rational matrix which lies in the interior of the cone of completely positive matrices also has a rational cp-factorization.
MSC:
| 90C25 | Convex programming |
References:
| [1] | Berman, A.; Shaked-Monderer, N., Completely Positive Matrices (2003), World Scientific Publishing Co. · Zbl 1030.15022 |
| [2] | Berman, A.; Dür, M.; Shaked-Monderer, N., Open problems in the theory of completely positive and copositive matrices, Electron. J. Linear Algebra, 29, 46-58 (2015) · Zbl 1326.15048 |
| [3] | Dür, M., Copositive programming - a survey, (Diehl, M.; Glineur, F.; Jarlebring, E.; Michiels, W., Recent Advances in Optimization and Its Applications in Engineering (2010), Springer), 3-20 |
| [4] | Grötschel, M.; Lovász, L.; Schrijver, A., Geometric Algorithms and Combinatorial Optimization (1988), Springer · Zbl 0634.05001 |
| [5] | Schrijver, A., Theory of Linear and Integer Programming (1986), Wiley · Zbl 0665.90063 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
