Co-organization of the workshop "Mathematical Foundations and Algorithms for Tensor Computations" which aims to bring together researchers with different expertise to exchange ideas on designing computational methods for various tensor problems. One of the main features: a focus on rigorous algorithms for which one may guarantee convergence to a global solution under reasonable conditions. Topics include provable algorithmic guarantees in terms of computational efficiency and robustness, algorithmic techniques like spectral methods, iterative methods for nonconvex optimization, and powerful convex relaxation hierarchies like sum-of-squares, etc, where correctness guarantees may be established under suitable assumptions motivated by applications.