Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Equilibrium Programming and New Iterative Methods in Hilbert Spaces

Equilibrium Programming and New Iterative Methods in Hilbert Spaces In this paper, we introduce a new iterative procedure for approximating a solution of an equilibrium problem involving a monotone and Lipschitz-type bifunction in a Hilbert space. The method includes two computational steps of proximal-like mapping incorporated with regularization terms. Several simple stepsize rules without linesearch are studied which allows the method to be more easily implemented with or without the information on the Lipschitz-type constant of cost bifunction. When the regularization parameter is suitably chosen, the iterative sequences generated by the method converge strongly to a particular solution of the problem. It turns out that the obtained solution by the method is the solution of a bilevel equilibrium problem whose constraint is the solution set of the considered equilibrium problem. Some numerical examples are computed to illustrate the computational effectiveness of the new method, and also to compare it with existing ones. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Applicandae Mathematicae Springer Journals

Equilibrium Programming and New Iterative Methods in Hilbert Spaces

Loading next page...
 
/lp/springer-journals/equilibrium-programming-and-new-iterative-methods-in-hilbert-spaces-mVEGWbvy0l

References (44)

Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Nature B.V. 2021
ISSN
0167-8019
eISSN
1572-9036
DOI
10.1007/s10440-021-00451-0
Publisher site
See Article on Publisher Site

Abstract

In this paper, we introduce a new iterative procedure for approximating a solution of an equilibrium problem involving a monotone and Lipschitz-type bifunction in a Hilbert space. The method includes two computational steps of proximal-like mapping incorporated with regularization terms. Several simple stepsize rules without linesearch are studied which allows the method to be more easily implemented with or without the information on the Lipschitz-type constant of cost bifunction. When the regularization parameter is suitably chosen, the iterative sequences generated by the method converge strongly to a particular solution of the problem. It turns out that the obtained solution by the method is the solution of a bilevel equilibrium problem whose constraint is the solution set of the considered equilibrium problem. Some numerical examples are computed to illustrate the computational effectiveness of the new method, and also to compare it with existing ones.

Journal

Acta Applicandae MathematicaeSpringer Journals

Published: Dec 1, 2021

Keywords: Equilibrium problem; Iterative method; Extragradient method; Regularization method; 65Y05; 65K15

There are no references for this article.