Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
From MaRDI portal
Publication:3058371
DOI10.1080/01630563.2010.510611zbMath1205.90296OpenAlexW2131182789MaRDI QIDQ3058371
Mostafa Nasri, Javad Mashreghi
Publication date: 19 November 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2010.510611
Related Items
Twelve monotonicity conditions arising from algorithms for equilibrium problems ⋮ A proximal augmented Lagrangian method for equilibrium problems ⋮ An inexact proximal method with proximal distances for quasimonotone equilibrium problems ⋮ Existence results for vector equilibrium problems given by a sum of two functions
Uses Software
Cites Work
- Unnamed Item
- Application of the proximal point method to nonmonotone equilibrium problems
- Auxiliary principle technique for equilibrium problems
- Strong convergence studied by a hybrid type method for monotone operators in a Banach space
- Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
- Weak and strong convergence theorems for a nonexpansive mapping and an equilibrium problem
- On certain conditions for the existence of solutions of equilibrium problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Equilibrium programming using proximal-like algorithms
- A strongly convergent hybrid proximal method in Banach spaces.
- Totally convex functions for fixed points computation and infinite dimensional optimization
- On nonconvex equilibrium problems
- Forcing strong convergence of Korpelevich's method in Banach spaces with its applications in game theory
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- On a proximal point method for convex optimization in banach spaces
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Iterative Algorithms for Equilibrium Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Augmented Lagrangian methods for variational inequality problems
- Application of the Proximal Point Method to a System of Extended Primal-Dual Equilibrium Problems
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems
- Partial proximal point method for nonmonotone equilibrium problems
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A note on equilibrium problems with properly quasimonotone bifunctions
