Add to ORKGInspired by the very recent work by Noor and Noor [9] and given a closed convex set-valued mapping C, we propose a split algorithm for solving the problem of finding an element x∗ which is a zero of a given maximal monotone operator T such that its image, Ax∗, under a linear operator, A, is in a closed convex set C(x∗). Then, we present two strong convergence results and state some examples as applications. The ideas and techniques of this paper may motivate the readers to discover some novel and innovative applications of the implicit split feasibility problems in various branches of pure and applied sciences
We propose a flexible approach for computing the resolvent of the sum of weakly monotone operators i...
The averaged alternating modified reflections algorithm is a projection method for finding the close...
The proximal point algorithm has known these last years many developments connected with the expansi...
Inspired by the very recent work by Noor and Noor [9] and given a closed convex set-valued mapping C...
Abstract In this paper, we present two iterative algorithms for approximating a solution of the spli...
International audienceThe aim of this paper is to present and investigate the asymptotic behavior of...
Abstract In this paper, we consider a type of split feasibility problem by focusing on the solution ...
Copyright c © 2013 Yuan-Fang Ma, Lin Wang and Xue-Jiao Zi. This is an open access article distribute...
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimizat...
AbstractThe purpose of this paper is to introduce and analyze an extragradient method with regulariz...
This thesis is concerned with the design and analysis of algorithms that solve nonsmooth convex opti...
Abstract. We present two modified versions of the primal-dual splitting algorithm relying on forward...
In this paper, we concern with the split feasibility problem (SFP) in real Hilbert space whenever th...
Abstract In this paper, we study the split-feasibility problem in Hilbert spaces by using the projec...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
We propose a flexible approach for computing the resolvent of the sum of weakly monotone operators i...
The averaged alternating modified reflections algorithm is a projection method for finding the close...
The proximal point algorithm has known these last years many developments connected with the expansi...
Inspired by the very recent work by Noor and Noor [9] and given a closed convex set-valued mapping C...
Abstract In this paper, we present two iterative algorithms for approximating a solution of the spli...
International audienceThe aim of this paper is to present and investigate the asymptotic behavior of...
Abstract In this paper, we consider a type of split feasibility problem by focusing on the solution ...
Copyright c © 2013 Yuan-Fang Ma, Lin Wang and Xue-Jiao Zi. This is an open access article distribute...
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimizat...
AbstractThe purpose of this paper is to introduce and analyze an extragradient method with regulariz...
This thesis is concerned with the design and analysis of algorithms that solve nonsmooth convex opti...
Abstract. We present two modified versions of the primal-dual splitting algorithm relying on forward...
In this paper, we concern with the split feasibility problem (SFP) in real Hilbert space whenever th...
Abstract In this paper, we study the split-feasibility problem in Hilbert spaces by using the projec...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
We propose a flexible approach for computing the resolvent of the sum of weakly monotone operators i...
The averaged alternating modified reflections algorithm is a projection method for finding the close...
The proximal point algorithm has known these last years many developments connected with the expansi...