Iterative algorithms for generalized mixed equilibrium problems (Q392352): Difference between revisions

The paper considers the generalized mixed equilibrium problem (GMEP). The presented iterative methods for equilibrium problems require either strongly monotonicity and Lipschitz continuity or inverse strongly monotonicity of the mapping \(T\). The authors study the convergence analysis of some iterative algorithms for GMEP, where the monotonicity (\(\theta\)-pseudo monotonicity) assumption on \(T\) is required which is weaker than strongly monotonicity and inverse strongly monotonicity. The auxiliary principle to the definition of a class of resolvent mappings is used. Further, using fixed point and resolvent methods, the authors give some iterative algorithms for solving GMEP. Main result: The authors prove that the sequences generated by iterative algorithms converge weakly to the solution of GMEP. These results require monotonicity (\(\theta\)-pseudo monotonicity) and continuity (Lipschitz continuity) for the mappings.