An inertial iterative method for solving split monotone inclusion problems in Hilbert spaces

The purpose of this work is to introduce and study a new type of a relaxed extrapolation iterative method for approximating the solution of a split monotone inclusion problem in the framework of Hilbert spaces. More so, we establish a strong convergence theorem of the proposed iterative method under the assumption that the set-valued operator is maximal monotone and the single-valued operator is Lipschitz continuous monotone which is weaker assumption unlike other methods in which the single-valued is inverse strongly monotone. We emphasize that the value of the Lipschitz constant is not required for the iterative technique to be implemented, and during computation, the Lipschitz continuity was not used. Lastly, we present an application and also some numerical experiments to show the efficiency and the applicability of our proposed iterative method.

Authors

Institutions

Publication Details

Journal
Numerical Algebra Control and Optimization
Published
2024-08-16
DOI
https://doi.org/10.3934/naco.2024039
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An inertial iterative method for solving split monotone inclusion problems in Hilbert spaces

A. A. Mebawondu, Ojen Kumar Narain, Akunna Sunsan Sunday, Adhir Maharaj
Numerical Algebra Control and Optimization
Optimization and Variational Analysis
article

An inertial iterative method for solving split monotone inclusion problems in Hilbert spaces

A. A. Mebawondu, Ojen Kumar Narain, Akunna Sunsan Sunday, Adhir Maharaj
article en

Abstract

The purpose of this work is to introduce and study a new type of a relaxed extrapolation iterative method for approximating the solution of a split monotone inclusion problem in the framework of Hilbert spaces. More so, we establish a strong convergence theorem of the proposed iterative method under the assumption that the set-valued operator is maximal monotone and the single-valued operator is Lipschitz continuous monotone which is weaker assumption unlike other methods in which the single-valued is inverse strongly monotone. We emphasize that the value of the Lipschitz constant is not required for the iterative technique to be implemented, and during computation, the Lipschitz continuity was not used. Lastly, we present an application and also some numerical experiments to show the efficiency and the applicability of our proposed iterative method.

Numerical Algebra Control and OptimizationVol. 15(3)
Durban University of Technology (ZA), University of KwaZulu-Natal (ZA)
Reduced inequalities
Openalex Percentile: Top 84%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An inertial iterative method for solving split monotone inclusion problems in Hilbert spaces — A. A. Mebawondu, Ojen Kumar Narain, et al. · Numerical Algebra Control and Optimization (2024) | TGRS Research Map | TGRS