2016/11/06 by Hadi Khatibzadeh, Khatibzadeh, Hadi, Vahid Mohebbi +1
Computer Science · Mathematics · #FOS: Mathematics #Fixed Point Theorems Analysis #Functional Analysis (math.FA) #Optimization and Variational Analysis #Point processes and geometric inequalities
paper · pdf · doi:10.48550/arxiv.1611.01830
openalex publication_date 2016/11/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove Δ-convergence of the generated sequence to a critical point (which is defined in the text) of an objective convex, proper and lower semicontinuous function with at least a minimum point as well as some strong convergence results to a minimum point with some additional conditions. The results extend the recent results of the proximal point algorithm in Hadamard manifolds and CAT(0) spaces.