Strong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms

strong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms

‎our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real hilbert space‎. ‎so many have used algorithms involving the operator norm for solving split equality fixed point problem‎, ‎...

A strong convergence theorem for solutions of zero point problems and fixed point problems

Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces‎.

Strong Convergence Theorems for the Split Common Fixed Point Problem for Countable Family of Nonexpansive Operators

a strong convergence theorem for solutions of zero point problems and fixed point problems

zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎a strong convergence theorem for the common solutions of the problems is established in the framework of hilbert spaces‎.

Solving proximal split feasibility problems without prior knowledge of operator norms

Abstract In this paper our interest is in investigating properties and numerical solutions of Proximal Split feasibility Problems. First, we consider the problem of finding a point which minimizes a convex function f such that its image under a bounded linear operator A minimizes another convex function g. Based on an idea introduced in [9], we propose a split proximal algorithm with a way of s...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.