2022
DOI: 10.37193/cjm.2023.01.21
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Steepest-Descent Algorithm for Convex Minimization Over the Fixed Point Set of Multivalued Mappings

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 18 publications
0
0
0
Order By: Relevance