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 selecting the step-sizes such that its implementation does not need any prior information about the operator norm. Because the calculation or at least an estimate of the operator norm A is not an easy task. Secondly, we investigate the case where one of the two involved functions is prox-regular, the novelty of this approach is that the associated proximal mapping is not nonexpansive any longer. Such situation is encountered, for instance, in numerical solution to phase retrieval problem in crystallography, astronomy and inverse scattering [10] and is therefore of great practical interest.
In this paper, we introduce a new three-step iteration scheme and establish convergence results for approximation of fixed points of nonexpansive mappings in the framework of Banach space. Further, we show that the new iteration process is faster than a number of existing iteration processes. To support the claim, we consider a numerical example and approximated the fixed point numerically by computer using Matlab.
The purpose of this paper is to introduce a new three step iteration scheme for approximation of fixed points of the nonexpansive mappings. We show that our iteration process is faster than all of the Picard, the Mann, the Agarwal et al., and the Abbas et al. iteration processes. We support our analytic proof by a numerical example in which we approximate the fixed point by a computer using Matlab program. We also prove some weak convergence and strong convergence theorems for the nonexpansive mappings. MSC: 47H09; 47H10
In this paper, we consider a new class of generalized extended nonlinear quasi-variational inequality problems involving set-valued relaxed monotone operators and establish its equivalence with the fixed point problem. We study criteria for existence of their solutions. Iterative methods for finding approximate solutions are also proposed and analyzed. MSC: 47J20; 65K10; 65K15; 90C33
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.