For the low rank tensor completion problem in the tensor train format, several computational methods have been developed, including block coordinate descent [1]}, iterative hard thresholding [2]}, gradient-based optimization [3]}, Riemannian optimization [4]}, [5]}, [6]}. In this paper, we study this problem based on the quotient geometry under a specific metric. The main contributions of this paper are summarized as follows:
