Partial proximal point method for nonmonotone equilibrium problems
- 1 June 2006
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 21 (3) , 373-384
Abstract
We consider a general equilibrium problem defined on a convex set, whose cost bifunction may be nonmonotone. We show that this problem can be solved by the inexact partial proximal point method. These results can be viewed as a generalization of the known convergence properties of the usual proximal point method.Keywords
This publication has 16 references indexed in Scilit:
- Application of the Proximal Point Method to Nonmonotone Equilibrium ProblemsJournal of Optimization Theory and Applications, 2003
- Pseudomonotone Variational Inequalities: Convergence of Proximal MethodsJournal of Optimization Theory and Applications, 2001
- Variable metric bundle methods: From conceptual to implementable formsMathematical Programming, 1997
- Equilibrium programming using proximal-like algorithmsMathematical Programming, 1996
- Generalized proximal point algorithm for convex optimizationJournal of Optimization Theory and Applications, 1996
- Partial Proximal Minimization Algorithms for Convex PprogrammingSIAM Journal on Optimization, 1994
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- A Generalization of the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1990
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976