Sikiric, Mathieu Dutour, Schuermann, Achill and Vallentin, Frank ORCID: 0000-0002-3205-4607 . A simplex algorithm for rational cp-factorization. Math. Program.. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

Full text not available from this repository.

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 2x2 matrix has an integral cp-factorization.

Item Type: Journal Article
Creators:
CreatorsEmailORCIDORCID Put Code
Sikiric, Mathieu DutourUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Schuermann, AchillUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Vallentin, FrankUNSPECIFIEDorcid.org/0000-0002-3205-4607UNSPECIFIED
URN: urn:nbn:de:hbz:38-348096
DOI: 10.1007/s10107-020-01467-4
Journal or Publication Title: Math. Program.
Publisher: SPRINGER HEIDELBERG
Place of Publication: HEIDELBERG
ISSN: 1436-4646
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Mathematical Institute
Subjects: no entry
Uncontrolled Keywords:
KeywordsLanguage
POSITIVE MATRICES; COMPUTATION; COMPLEXITY; INTERIORMultiple languages
Computer Science, Software Engineering; Operations Research & Management Science; Mathematics, AppliedMultiple languages
Refereed: Yes
URI: http://kups.ub.uni-koeln.de/id/eprint/34809

Downloads

Downloads per month over past year

Altmetric

Export

Actions (login required)

View Item View Item