Skip to Main content Skip to Navigation

Path-connectedness of tensor ranks

Abstract : Computations of low-rank approximations of tensors often involve path-following optimization algorithms. In such cases, a correct solution may only be found if there exists a continuous path connecting the initial point to a desired solution. We will investigate the existence of such a path in sets of low-rank tensors for various notions of ranks, including tensor rank, border rank, multilinear rank, and their counterparts for symmetric tensors.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02121152
Contributor : Pierre Comon <>
Submitted on : Monday, May 6, 2019 - 2:08:10 PM
Last modification on : Monday, January 13, 2020 - 1:14:12 AM

File

QiCLY19-v10.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Yang Qi, Pierre Comon, Lek-Heng Lim, Ke Ye. Path-connectedness of tensor ranks. EUSIPCO 2019 - 27th European Signal Processing Conference, Sep 2019, A Coruna, Spain. ⟨10.23919/EUSIPCO.2019.8903027⟩. ⟨hal-02121152⟩

Share

Metrics

Record views

109

Files downloads

219