Abstract
ABSTRACT In this paper, we consider a special split feasibility problem (SFP): where C is the solution set of an equilibrium problem, Q is a convex subset in , and is a linear operator. We introduce two projection algorithms for solving the SFP by combining the projection method for the equilibrium problem and the gradient method for the inclusion . The proposed algorithms are shown to converge a solution of the SFP under weak conditions. We present a numerical example for a jointly constrained Nash equilibrium model in electricity production market to demonstrate the behaviour of the proposed algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
