Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 64, 2015 - Issue 10
164
Views
0
CrossRef citations to date
0
Altmetric
Articles

Interior proximal extragradient method for equilibrium problems

Pages 2145-2161 | Received 05 Apr 2013, Accepted 30 Apr 2014, Published online: 23 Jun 2014
 

Abstract

The Bregman function-based Proximal Point Algorithm (BPPA) is an efficient tool for solving equilibrium problems and fixed-point problems. Extending rather classical proximal regularization methods, the main additional feature consists in an application of zone coercive regularizations. The latter allows to treat the generated subproblems as unconstrained ones, albeit with a certain precaution in numerical experiments. However, compared to the (classical) Proximal Point Algorithm for equilibrium problems, convergence results require additional assumptions which may be seen as the price to pay for unconstrained subproblems. Unfortunately, they are quite demanding – for instance, as they imply a sort of unique solvability of the given problem. The main purpose of this paper is to develop a modification of the BPPA, involving an additional extragradient step with adaptive (and explicitly given) stepsize. We prove that this extragradient step allows to leave out any of the additional assumptions mentioned above. Hence, though still of interior proximal type, the suggested method is applicable to an essentially larger class of equilibrium problems, especially including non-uniquely solvable ones.

AMS Subject Classifications:

Notes

1 We refer to [Citation11] for a detailed description of the enhancements compared to the original paper of Flåm and Antipin.

2 This assumption might also be replaced by conditions not occuring in [Citation11, Theorem 1] as long as they still imply well-definedness of the studied method.

3 For the subsequent analysis, it is completely irrelevant whether or not.

4 Following a combination of the references,[Citation22, Citation26] other examples may also be deduced, e.g. for being a ball. Of course, in case of more complex and / or unbounded feasible sets , it is rather unlikely that is explicitly invertible. Anyway, the extragradient step then still appears to be numerically attractive due to its above construction; for instance, it is uniquely solvable.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 630.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.