The multilinear rank of a tensor is one of the possible generalizations for the concept of matrix rank. In this paper, we are interested in finding the best low multilinear rank approximation of a given tensor. This problem has been formulated as an optimization problem over the Grassmann manifold [14] and it has been shown that the objective function presents multiple minima [15]. In order to investigate the landscape of this cost function, we propose an adaptation of the Particle Swarm Optimization algorithm (PSO). The Guaranteed Convergence PSO, proposed by van den Bergh in [23], is modified, including a gradient component, so as to search for optimal solutions over the Grassmann manifold. The operations involved in the PSO algorithm are redefined using concepts of differential geometry. We present some preliminary numerical experiments and we discuss the ability of the proposed method to address the multimodal aspects of the studied problem. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Borckmans, P. B., Ishteva, M., & Absil, P. A. (2010). A modified particle swarm optimization algorithm for the best low multilinear rank approximation of higher-order tensors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6234 LNCS, pp. 13–23). https://doi.org/10.1007/978-3-642-15461-4_2
Mendeley helps you to discover research relevant for your work.