Partial proximal point method for nonmonotone equilibrium problems
From MaRDI portal
Publication:5475280
DOI10.1080/10556780500094838zbMath1136.90506OpenAlexW2086679076MaRDI QIDQ5475280
Publication date: 16 June 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500094838
Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Variational inequalities (49J40) Nonlinear ill-posed problems (47J06)
Related Items
A convergent inexact solution method for equilibrium problems ⋮ New extragradient method for a class of equilibrium problems in Hilbert spaces ⋮ Twelve monotonicity conditions arising from algorithms for equilibrium problems ⋮ Refinements of existence results for relaxed quasimonotone equilibrium problems ⋮ Maximal monotonicity of bifunctions ⋮ Two new extragradient methods for solving equilibrium problems ⋮ Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces ⋮ Study of equilibrium problem in Hadamard manifolds by extending some concepts of nonlinear analysis ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ Relaxed quasimonotone operators and relaxed quasiconvex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Application of the proximal point method to nonmonotone equilibrium problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Variable metric bundle methods: From conceptual to implementable forms
- Equilibrium programming using proximal-like algorithms
- Duality for equilibrium problems under generalized monotonicity
- Characterization of nonsmooth semistrictly quasiconvex and strictly quasiconvex functions
- Mixed variational inequalities and economic equilibrium problems
- Generalized proximal point algorithm for convex optimization
- A Generalization of the Proximal Point Algorithm
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Additively decomposed quasiconvex functions
- Additively decomposed quasiconvex functions
- Pseudomonotone variational inequalities: Convergence of proximal methods
This page was built for publication: Partial proximal point method for nonmonotone equilibrium problems
