in the present paper, we rst modify the concepts of weakly fuzzy boundedness, strongly fuzzy boundedness, fuzzy continuity, strongly fuzzy continuity and weakly fuzzy continuity. then, we try to nd some relations by making a comparative study of the fuzzy norms of linear operators.

Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which generalizes all main semantics of logic programming, default logic and autoepistemic logic. In this paper, we study inductive constructions using operators and show their confluence to the well-founded fixpoint of the operator. This result is one argument for the thesis that Approximation theory is ...

A new type of approximating curve for finding a particular zero of the sum of two maximal monotone operators in a Hilbert space is investigated. This curve consists of the zeros of perturbed problems in which one operator is replaced with its Yosida approximation and a viscosity term is added. As the perturbation vanishes, the curve is shown to converge to the zero of the sum that solves a part...

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar’s constraint qualification holds. In this paper, we establish the maximal monotonicity of A+ B provided that A and B are maximally monotone operators such that star(domA)∩ int domB 6= ∅, and A is of type (FPV). We sh...

In this work we focus on the convex feasibility problem (CFP) in Hilbert space. A specific method area that has gained a lot of interest recent years is Douglas-Rachford (DR) algorithm. This algorithm was originally introduced 1956 for solving stationary and non-stationary heat equations. Then 1979, Lions Mercier adjusted extended with aim CFPs even more general problems, such as finding zeros ...

Let H be a real Hilbert space and let F : H → H be a boundedly Lipschitzian and strongly monotone operator. We design three hybrid steepest descent algorithms for solving variational inequality VI C, F of finding a point x∗ ∈ C such that 〈Fx∗, x − x∗〉 ≥ 0, for all x ∈ C, where C is the set of fixed points of a strict pseudocontraction, or the set of common fixed points of finite strict pseudoco...