Minimization problem of proximal point algorithm in complete cat(0) spaces
Filomat, Tome 36 (2022) no. 18, p. 6289
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper a proximal point algorithm for a convex function is considered in complete CAT(0) spaces. We introduce a necessary and sufficient condition for the set of minimizers of the function to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of minimizers of the function.
Classification :
47H04, 47H05, 26B25, 26E25, 90C33, 47H10
Keywords: Convex minimization problem, Proximal point algorithm, Nonexpansive mapping, Resolvent operator
Keywords: Convex minimization problem, Proximal point algorithm, Nonexpansive mapping, Resolvent operator
Sirous Moradi; Mohsen Tahernia. Minimization problem of proximal point algorithm in complete cat(0) spaces. Filomat, Tome 36 (2022) no. 18, p. 6289 . doi: 10.2298/FIL2218289M
@article{10_2298_FIL2218289M,
author = {Sirous Moradi and Mohsen Tahernia},
title = {Minimization problem of proximal point algorithm in complete cat(0) spaces},
journal = {Filomat},
pages = {6289 },
year = {2022},
volume = {36},
number = {18},
doi = {10.2298/FIL2218289M},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2218289M/}
}
TY - JOUR AU - Sirous Moradi AU - Mohsen Tahernia TI - Minimization problem of proximal point algorithm in complete cat(0) spaces JO - Filomat PY - 2022 SP - 6289 VL - 36 IS - 18 UR - http://geodesic.mathdoc.fr/articles/10.2298/FIL2218289M/ DO - 10.2298/FIL2218289M LA - en ID - 10_2298_FIL2218289M ER -
Cité par Sources :