Back to Search
Start Over
Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces
- Source :
- Numerical Algorithms. 82:909-935
- Publication Year :
- 2018
- Publisher :
- Springer Science and Business Media LLC, 2018.
-
Abstract
- In this paper, we study strong convergence of some proximal-type algorithms to a solution of split minimization problem in complete p-uniformly convex metric spaces. We also analyse asymptotic behaviour of the sequence generated by Halpern-type proximal point algorithm and extend it to approximate a common solution of a finite family of minimization problems in the setting of complete p-uniformly convex metric spaces. Furthermore, numerical experiments of our algorithms in comparison with other algorithms are given to show the applicability of our results.
- Subjects :
- Sequence
Applied Mathematics
Numerical analysis
Minimization problem
010103 numerical & computational mathematics
Type (model theory)
01 natural sciences
Convex metric space
010101 applied mathematics
Convergence (routing)
Theory of computation
Minification
0101 mathematics
Algorithm
Mathematics
Subjects
Details
- ISSN :
- 15729265 and 10171398
- Volume :
- 82
- Database :
- OpenAIRE
- Journal :
- Numerical Algorithms
- Accession number :
- edsair.doi...........a4977819d526aea5003f9eeb0a3a98a4