Abstract
Abstract In the present paper, an iterative algorithm for solving mixed equilibrium problems and fixed points problems has been constructed. It is shown that under some mild conditions, the sequence generated by the presented algorithm converges strongly to the common solution of mixed equilibrium problems and fixed points problems. As an application, we can find the minimum norm element without involving projection. MSC:47J05, 47J25, 47H09.
Highlights
Let H be a real Hilbert space with the inner product ·, · and the norm ·, respectively
3 Main results we prove our main results
Let C be a nonempty closed convex subset of a real Hilbert space H and let F : C × C → R be a bifunction satisfying conditions (H )-(H )
Summary
Let H be a real Hilbert space with the inner product ·, · and the norm · , respectively.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
