A note on the computation of the CP-rank

Type: Article

Publication Date: 2006-06-19

Citations: 35

DOI: https://doi.org/10.1016/j.laa.2006.04.001

View

Locations

  • Linear Algebra and its Applications - View

Similar Works

Action Title Year Authors
+ A note on the rank of matrices 2014 Liqun Tao
+ A note on the p-local rank 2005 Baoshan Wang
+ A note on the generalized rank reduction 2007 Aurél Galántai
+ Several remarks on tensor rank computation 2025 Yaroslav Shitov
+ PDF Chat A comparison theorem for the 2-rank of 𝐾₂(𝒪) 1986 P. E. Conner
Jürgen Hurrelbrink
+ New Lower Bounds and Asymptotics for the cp-Rank 2015 Immanuel M. Bomze
Werner Schachinger
Reinhard Ullrich
+ A polynomial-time algorithm for computing low CP-rank decompositions 2016 Khaled Elbassioni
Trung Thanh Nguyen
+ Remarks on finite rank projections 1973 William J. Davis
+ An approximation method of CP rank for third-order tensor completion 2021 Chao Zeng
Tai-Xiang Jiang
Michael K. Ng
+ Computing the cactus rank of a general form 2012 Alessandra Bernardi
Joachim Jelisiejew
Pedro Macías Marques
Kristian Ranestad
+ The Complexity of Tensor Rank 2017 Marcus Schaefer
Daniel Štefankovič
+ The exponential rank 1999 Salma Kuhlmann
+ PDF Chat Basic rank-order program 1982 Kathleen A. McNally
D. Louis Wood
+ A strengthened Barvinok-Pataki bound on SDP rank 2021 JiYoung Im
Henry Wolkowicz
+ The rank reduction procedure of Egerváry 2009 Aurél Galántai
+ On the maximum rank of a tensor product 1985 Paris Pamfilos
+ A Proof of the Frobenius Rank Equality 1980 Donald W. Robinson
+ On a rank of a matrix of dimension k 2013 Rosa Ferrentino
Carmine Boniello
+ An Algebraic Approach to the Rank Support Learning Problem 2021 Magali Bardet
Pierre Briaud
+ Determining Rank in the Presence of Error 1993 G. W. Stewart

Cited by (31)

Action Title Year Authors
+ The $${\mathcal {A}}$$ A -Truncated $$K$$ K -Moment Problem 2014 Jiawang Nie
+ Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization 2011 Immanuel M. Bomze
Werner Schachinger
Gabriele Uchida
+ The A-truncated K-moment problem 2012 Jiawang Nie
+ Factorization and cutting planes for completely positive matrices by copositive projection 2012 Julia Sponsel
Mirjam Dür
+ Semialgebraic Geometry of Nonnegative Tensor Rank 2016 Qi Yang
Pierre Comon
Lek‐Heng Lim
+ PDF Chat A simplex algorithm for rational cp-factorization 2020 Mathieu Dutour Sikirić
Annette Schürmann
Frank Vallentin
+ Copositive Programming – a Survey 2010 Mirjam Dür
+ Completely Positive Matrices: Real, Rational, and Integral 2018 Abraham Berman
Naomi Shaked-Monderer
+ Computing symmetric nonnegative rank factorizations 2011 Vassilis Kalofolias
Efstratios Gallopoulos
+ Real rank versus nonnegative rank 2009 LeRoy B. Beasley
Thomas J. Laffey
+ PDF Chat The difference between <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mrow><mml:mn>5</mml:mn><mml:mo>×</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:math> doubly nonnegative and completely positive matrices 2009 Samuel Burer
Kurt M. Anstreicher
Mirjam Dür
+ Copositive Programming - a Survey 2010 Johann Bernoulli
+ PDF Chat An Adaptive Linear Approximation Algorithm for Copositive Programs 2009 Stefan Bundfuss
Mirjam Dür
+ PDF Chat Open problems in the theory of completely positive and copositive matrices 2015 Avi Berman
Mirjam Dür
Naomi Shaked-Monderer
+ PDF Chat Building a completely positive factorization 2017 Immanuel M. Bomze
+ PDF Chat Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization 2019 Sander Gribling
David de Laat
Monique Laurent
+ PDF Chat Semialgebraic Geometry of Nonnegative Tensor Rank 2016 Qi Yang
Pierre Comon
Lek‐Heng Lim
+ Conic Reformulation of Some Quadratic Programming Problems with Applications 2012 Ye Tian
+ The cone of flow matrices: Approximation hierarchies and applications 2018 Guillaume Sagnol
Marco Blanco
Thibaut Sauvage
+ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization 2017 Sander Gribling
David de Laat
Monique Laurent
+ A polynomial-time algorithm for computing low CP-rank decompositions 2016 Khaled Elbassioni
Trung Thanh Nguyen
+ Copositive Programming 2011 Samuel Burer
+ Optimizing a polyhedral-semidefinite relaxation of completely positive programs 2010 Samuel Burer
+ A universality theorem for nonnegative matrix factorizations 2016 Yaroslav Shitov
+ On the computation of C* certificates 2008 Florian Jarre
Katrin Schmallowsky
+ Some aspects of the optimization over the copositive and the completely positive cone 2013 Julia Witzel
+ Nonnegative rank factorization—a heuristic approach via rank reduction 2013 Bo Dong
Matthew M. Lin
Moody T. Chu
+ IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. 2017 Mirjam Dür
+ PDF Chat Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices 2012 Peter J. C. Dickinson
Mirjam Duer
+ The copositive cone, the completely positive cone and their generalisations 2013 Peter J. C. Dickinson
+ Noncommutative Polynomial Optimization 2022 Abhishek Bhardwaj
Igor Klep
Victor Magron