Proximal Point Algorithm with Euclidean Distance on the Stiefel Manifold

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

1 Cita (Scopus)

Resumen

In this paper, we consider the problem of minimizing a continuously differentiable function on the Stiefel manifold. To solve this problem, we develop a geodesic-free proximal point algorithm equipped with Euclidean distance that does not require use of the Riemannian metric. The proposed method can be regarded as an iterative fixed-point method that repeatedly applies a proximal operator to an initial point. In addition, we establish the global convergence of the new approach without any restrictive assumption. Numerical experiments on linear eigenvalue problems and the minimization of sums of heterogeneous quadratic functions show that the developed algorithm is competitive with some procedures existing in the literature.

Idioma originalInglés
Número de artículo2414
PublicaciónMathematics
Volumen11
N.º11
DOI
EstadoPublicada - jun. 2023
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Proximal Point Algorithm with Euclidean Distance on the Stiefel Manifold'. En conjunto forman una huella única.

Citar esto