Abstract
Convergence results of the subgradient algorithm for equilibrium problems were mainly obtained using a Lipschitz continuity assumption on the given bifunctions. In this paper, we first provide a complexity result for monotone equilibrium problems without assuming Lipschitz continuity. Moreover, we give a convergence result of the value of the averaged sequence of iterates beyond Lipschitz continuity. Next, we derive a rate convergence in terms of the distance to the solution set relying on a growth condition. Applications to convex minimization and min–max problems are also stated. These ideas and results deserve to be developed and further refined.
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.
