International audienceWe show that for a nonnegative tensor, a best nonnegative rank-$r$ approximation is almost always unique, its best rank-one approximation may always be chosen to be a best nonnegative rank-one approximation, and that the set of nonnegative tensors with non-unique best rank-one approximations form an algebraic hypersurface. We show that the last part holds true more generally for real tensors and thereby determine a polynomial equation so that a real or nonnegative tensor which does not satisfy this equation is guaranteed to have a unique best rank-one approximation. We also establish an analogue for real or nonnegative symmetric tensors. In addition, we prove a singular vector variant of the Perron--Frobenius Theorem ...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation of a matr...
© 2016 Society for Industrial and Applied Mathematics. This paper studies models and algorithms for ...
We show that a best nonnegative rank-r approximation of a nonnegative tensor is almost always unique...
Abstract. Necessary conditions are derived for a rank-r tensor to be a best rank-r approximation of ...
AbstractIt has been shown that a best rank-R approximation of an order-k tensor may not exist when R...
Abstract. In this paper we define the best rank-one approximation ratio of a tensor space. It turns ...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation to a matr...
Given a tensor f in a Euclidean tensor space, we are interested in the critical points of the distan...
In this paper we define the best rank-one approximation ratio of a tensor space. It turns out that i...
Unlike matrix rank, hypermatrix rank is not lower semi-continuous. As a result, optimal low rank app...
\u3cp\u3eGiven a tensor f in a Euclidean tensor space, we are interested in the critical points of t...
We propose a new sufficient condition for verifying whether general rank-r complex tensors of arbitr...
Joint work with Jan Draisma and Giorgio Ottaviani. Given a tensor f in a Euclidean tensor space, we ...
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius no...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation of a matr...
© 2016 Society for Industrial and Applied Mathematics. This paper studies models and algorithms for ...
We show that a best nonnegative rank-r approximation of a nonnegative tensor is almost always unique...
Abstract. Necessary conditions are derived for a rank-r tensor to be a best rank-r approximation of ...
AbstractIt has been shown that a best rank-R approximation of an order-k tensor may not exist when R...
Abstract. In this paper we define the best rank-one approximation ratio of a tensor space. It turns ...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation to a matr...
Given a tensor f in a Euclidean tensor space, we are interested in the critical points of the distan...
In this paper we define the best rank-one approximation ratio of a tensor space. It turns out that i...
Unlike matrix rank, hypermatrix rank is not lower semi-continuous. As a result, optimal low rank app...
\u3cp\u3eGiven a tensor f in a Euclidean tensor space, we are interested in the critical points of t...
We propose a new sufficient condition for verifying whether general rank-r complex tensors of arbitr...
Joint work with Jan Draisma and Giorgio Ottaviani. Given a tensor f in a Euclidean tensor space, we ...
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius no...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation of a matr...
© 2016 Society for Industrial and Applied Mathematics. This paper studies models and algorithms for ...