On projection mappings and the gradient projection method on hyperbolic space forms

Abstract

This paper presents several new properties of the intrinsic -projection into -hyperbolically convex sets of -hyperbolic space forms, along with closed-form formulas for the intrinsic -projection into specific -hyperbolically convex sets. It also discusses the relationship between the intrinsic -projection, the Euclidean orthogonal projection and the Lorentz projection. These properties lay the groundwork for analyzing the gradient projection method and hold importance in their own right. Additionally, new properties of the gradient projection method to solve constrained optimization problems in -hyperbolic space forms are established, considering both constant and backtracking step sizes in the analysis. It is shown that every accumulation point of the sequence generated by the method for both step sizes is a stationary point for the given problem. Additionally, an iteration complexity bound is provided that upper bounds the number of iterations needed to achieve a suitable measure of stationarity for both step sizes. Finally, the properties of the constrained Fermat–Weber problem are explored, demonstrating that the sequence generated by the gradient projection method converges to its unique solution. Numerical experiments on solving the Fermat–Weber problem are presented, illustrating the theoretical findings and demonstrating the effectiveness of the proposed methods.