International audienceComputations 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
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
This master's thesis addresses numerical methods of computing the typical ranks of tensors over the ...
This master's thesis addresses numerical methods of computing the typical ranks of tensors over the ...
International audienceWe study path-connectedness and homotopy groups of sets of tensors defined by ...
International audienceWe study path-connectedness and homotopy groups of sets of tensors defined by ...
International audienceWe study path-connectedness and homotopy groups of sets of tensors defined by ...
Abstract — We present a new connection between higher-order tensors and affinely structured matrices...
This paper deals with the best low multilinear rank approximation of higher-order tensors. Given a t...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
Submitted to SIAM Journal on Scientific ComputingComputing low-rank approximations is one of the mos...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
This master's thesis addresses numerical methods of computing the typical ranks of tensors over the ...
This master's thesis addresses numerical methods of computing the typical ranks of tensors over the ...
International audienceWe study path-connectedness and homotopy groups of sets of tensors defined by ...
International audienceWe study path-connectedness and homotopy groups of sets of tensors defined by ...
International audienceWe study path-connectedness and homotopy groups of sets of tensors defined by ...
Abstract — We present a new connection between higher-order tensors and affinely structured matrices...
This paper deals with the best low multilinear rank approximation of higher-order tensors. Given a t...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
Submitted to SIAM Journal on Scientific ComputingComputing low-rank approximations is one of the mos...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
This master's thesis addresses numerical methods of computing the typical ranks of tensors over the ...
This master's thesis addresses numerical methods of computing the typical ranks of tensors over the ...