JAndriesJ /ju-cp-rank

This code models the problem of bounding the completely positive rank of a symmetric nonnegative matrix via moment hierarchies.

Additional Metadata
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Steenkamp, A. (2023). JAndriesJ /ju-cp-rank.

Additional Files
View at GitHub

See Also
article Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks M. Korda (Korda), M. Laurent (Monique), V. Magron (Victor) and J.A.J. Steenkamp (Andries)

Publication