Pregled bibliografske jedinice broj: 1217271
A simplex algorithm for rational cp-factorization
A simplex algorithm for rational cp-factorization // Mathematical programming, 187 (2021), 1-2; 25-45 doi:10.1007/s10107-020-01467-4 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1217271 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A simplex algorithm for rational cp-factorization
Autori
Dutour Sikirić, Mathieu ; Schürmann, Achill ; Vallentin, Frank
Izvornik
Mathematical programming (0025-5610) 187
(2021), 1-2;
25-45
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Copositive programming ; Complete positivity ; Matrix factorization ; Copositive minimum
Sažetak
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 2×2 matrix has an integral cp-factorization.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
