2016New Trends in Mathematical ScienceOpen access

Strong convergence with a modified iterative projection method for hierarchical fixed point problems and variational inequalities

İbrahim Karahan, Murat Özdemir

Open full text 0 citations

Abstract

Let C be a nonempty closed convex subset of a real Hilbert space H. Let {T n } : C → H be a sequence of nearly nonexpansive mappings such that F := ∞ i=1 F T i = .Let V : C → H be a γ-Lipschitzian mapping and F : C → H be a L-Lipschitzian and η-strongly monotone operator.This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem.It is shown that under certain approximate assumptions on the operators and parameters, the modified iterative sequence {x n } converges strongly to x * ∈ F which is also the unique solution of the following variational inequality:As a special case, this projection method can be used to find the minimum norm solution of above variational inequality; namely, the unique solution x * to the quadratic minimization problem: x * = ar g mi n x∈F x 2 .The results here improve and extend some recent corresponding results of other authors.

Open-access reader

About this research paper

What this paper is about

Let C be a nonempty closed convex subset of a real Hilbert space H. Let {T n } : C → H be a sequence of nearly nonexpansive mappings such that F := ∞ i=1 F T i = .Let V : C → H be a γ-Lipschitzian mapping and F : C → H be a L-Lipschitzian and η-strongly monotone operator.This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem.It is shown that under certain approximate assumptions on the operators and parameters, the modified iterative sequence {x n } converges strongly to x * ∈ F which is also the unique solution of the following variational inequality:As a special case, this projection method can be used to find the minimum norm solution of above variational inequality; namely, the unique solution x * to the quadratic minimization problem: x * = ar g mi n x∈F x 2 .The results here improve and extend some recent corresponding results of other authors.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let C be a nonempty closed convex subset of a real Hilbert space H. Let {T n } : C → H be a sequence of nearly nonexpansive mappings such that F := ∞ i=1 F T i = .Let V : C → H be a γ-Lipschitzian mapping and F : C → H be a L-Lipschitzian and η-strongly monotone operator.This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem.It is shown that under certain approximate assumptions on the operators and parameters, the modified iterative sequence {x n } converges strongly to x * ∈ F which is also the unique solution of the following variational inequality:As a special case, this projection method can be used to find the minimum norm solution of above variational inequality; namely, the unique solution x * to the quadratic minimization problem: x * = ar g mi n x∈F x 2 .The results here improve and extend some recent corresponding results of other authors.

Key concepts: Fixed point, Variational inequality, Convergence (economics), Mathematics, Projection (relational algebra), Mathematical optimization, Applied mathematics, Iterative method

Related papers

Back to paper searchBrowse research topicsOriginal source
Strong convergence with a modified iterative projection method for hierarchical fixed point problems and variational inequalities — Research Paper | ScholarLens