Show simple item record

dc.contributor.advisorMewomo, Oluwatosin Temitope.
dc.creatorOwolabi, Abd-semii Oluwatosin-Enitan.
dc.date.accessioned2020-07-17T17:27:14Z
dc.date.available2020-07-17T17:27:14Z
dc.date.created2020
dc.date.issued2020
dc.identifier.urihttps://researchspace.ukzn.ac.za/handle/10413/18529
dc.descriptionMasters Degree. University of KwaZulu-Natal, Durban.en_US
dc.description.abstractIn this dissertation, we introduce a self-adaptive hybrid inertial algorithm for approximating a solution of split feasibility problem which also solves a monotone inclusion problem and a fixed point problem in p-uniformly convex and uniformly smooth Banach spaces. We prove a strong convergence theorem for the sequence generated by our algorithm which does not require a prior knowledge of the norm of the bounded linear operator. Numerical examples are given to compare the computational performance of our algorithm with other existing algorithms. Moreover, we present a new iterative algorithm of inertial form for solving Monotone Inclusion Problem (MIP) and common Fixed Point Problem (FPP) of a finite family of demimetric mappings in a real Hilbert space. Motivated by the Armijo line search technique, we incorporate the inertial technique to accelerate the convergence of the proposed method. Under standard and mild assumptions of monotonicity and Lipschitz continuity of the MIP associated mappings, we establish the strong convergence of the iterative algorithm. Some numerical examples are presented to illustrate the performance of our method as well as comparing it with the non-inertial version and some related methods in the literature. Furthermore, we propose a new modified self-adaptive inertial subgradient extragradient algorithm in which the two projections are made onto some half spaces. Moreover, under mild conditions, we obtain a strong convergence of the sequence generated by our proposed algorithm for approximating a common solution of variational inequality problems and common fixed points of a finite family of demicontractive mappings in a real Hilbert space. The main advantages of our algorithm are: strong convergence result obtained without prior knowledge of the Lipschitz constant of the the related monotone operator, the two projections made onto some half-spaces and the inertial technique which speeds up rate of convergence. Finally, we present an application and a numerical example to illustrate the usefulness and applicability of our algorithm.en_US
dc.language.isoenen_US
dc.subject.otherBanach spaces.en_US
dc.subject.otherHilbert spaces.en_US
dc.subject.otherOptimization problems.en_US
dc.subject.otherIterative algorithms.en_US
dc.subject.otherFixed point problems.en_US
dc.subject.otherAlgorithms.en_US
dc.titleSelf-adaptive inertial algorithms for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems.en_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record