A non-monotone linear search algorithm with mixed direction on Stiefel manifold

Harry Oviedo, Hugo Lara, Oscar Dalmau

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

7 Citas (Scopus)


In this paper, we propose a non-monotone line search method for solving optimization problems on Stiefel manifold. The main novelty of our approach is that our method uses a search direction based on a linear combination of descent directions and a Barzilai–Borwein line search. The feasibility is guaranteed by projecting each iterate on the Stiefel manifold through SVD (singular value decomposition) factorizations. Some theoretical results for analysing the algorithm are presented. Finally, we provide numerical experiments for comparing our algorithm with other state-of-the-art procedures. The code is available online. The experimental results show that the proposed algorithm is competitive with other approaches and for particular problems, the computational performance is better than the state-of-the-art algorithms.

Idioma originalInglés
Páginas (desde-hasta)437-457
Número de páginas21
PublicaciónOptimization Methods and Software
EstadoPublicada - 4 mar. 2019
Publicado de forma externa


Profundice en los temas de investigación de 'A non-monotone linear search algorithm with mixed direction on Stiefel manifold'. En conjunto forman una huella única.

Citar esto