A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces

From MaRDI portal
Publication:780429




Abstract: The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are analyzed by employing suitable conditions on the control sequences of parameters and the structural properties of the under lying space. We aim to establish strong and del-convergence results of the proposed iterative algorithm and compute an optimal solution for a minimizer of proper convex lower semicontinuous function and a common fixed point of a finite family of total asymptotically nonexpansive mappings in Hadamard spaces. Our results can be viewed as an extension and generalization of various corresponding results established in the current literature.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780429)