Proximal point algorithm for infinite pseudo-monotone bifunctions
Publication:2817237
DOI10.1080/02331934.2016.1153639zbMath1398.90179OpenAlexW2317498941MaRDI QIDQ2817237
Vahid Mohebbi, Hadi Khatibzadeh
Publication date: 29 August 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1153639
strong convergenceweak convergenceequilibrium problemproximal point algorithmpseudo-monotone bifunctionHalpern's method
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Hilbert spaces of continuous, differentiable or analytic functions (46E20)
Related Items (15)
Cites Work
- On the strong convergence of Halpern type proximal point algorithm
- Some remarks on the proximal point algorithm
- Dual extragradient algorithms extended to equilibrium problems
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
- On the proximal point algorithm
- On certain conditions for the existence of solutions of equilibrium problems
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Produits infinis de resolvantes
- On the contraction-proximal point algorithms with multi-parameters
- On the proximal point method for equilibrium problems in Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Convergence analysis of the proximal point algorithm for pseudo-monotone equilibrium problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Iterative Algorithms for Equilibrium Problems
This page was built for publication: Proximal point algorithm for infinite pseudo-monotone bifunctions