Loading…
A Hybrid Steepest-Descent Algorithm for Convex Minimization Over the Fixed Point Set of Multivalued Mappings
In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of multivalued demicontractive mappings. We also provide numerical results concerning the viability of the...
Saved in:
Published in: | Carpathian Journal of Mathematics 2023-01, Vol.39 (1), p.303-314 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of multivalued demicontractive mappings. We also provide numerical results concerning the viability of the proposed algorithm with possible applications. |
---|---|
ISSN: | 1584-2851 1843-4401 |
DOI: | 10.37193/CJM.2023.01.21 |