A New Two-Step Proximal Algorithm of Solving the Problem of Equilibrium Programming

Sergey I. Lyashko () and Vladimir V. Semenov ()
Additional contact information
Sergey I. Lyashko: Kiev National Taras Shevchenko University
Vladimir V. Semenov: Kiev National Taras Shevchenko University

A chapter in Optimization and Its Applications in Control and Data Sciences, 2016, pp 315-325 from Springer

Abstract: Abstract We propose a new iterative two-step proximal algorithm for solving the problem of equilibrium programming in a Hilbert space. This method is a result of extension of L.D. Popov’s modification of Arrow-Hurwicz scheme for approximation of saddle points of convex-concave functions. The convergence of the algorithm is proved under the assumption that the solution exists and the bifunction is pseudo-monotone and Lipschitz-type.

Keywords: Equilibrium problem; Variational inequality; Two-step proximal algorithm; Bifunction; Pseudomonotonicity; Lipschitz condition; Convergence (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (5)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-42056-1_10

Ordering information: This item can be ordered from
http://www.springer.com/9783319420561

DOI: 10.1007/978-3-319-42056-1_10

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().