An approximate bundle method for solving nonsmooth equilibrium problems
- 306 Downloads
We present an approximate bundle method for solving nonsmooth equilibrium problems. An inexact cutting-plane linearization of the objective function is established at each iteration, which is actually an approximation produced by an oracle that gives inaccurate values for the functions and subgradients. The errors in function and subgradient evaluations are bounded and they need not vanish in the limit. A descent criterion adapting the setting of inexact oracles is put forward to measure the current descent behavior. The sequence generated by the algorithm converges to the approximately critical points of the equilibrium problem under proper assumptions. As a special illustration, the proposed algorithm is utilized to solve generalized variational inequality problems. The numerical experiments show that the algorithm is effective in solving nonsmooth equilibrium problems.
KeywordsEquilibrium problems Bundle methods Approximate function and subgradient
Mathematics Subject Classification90C25 49J40 90C20
The authors thank two anonymous referees for a number of valuable and helpful suggestions.
- 2.Bigi, G., Pappalardo, M., Passacantando, M.: Optimization tools for solving equilibrium problems with nonsmooth data. J. Optim. Theory Appl. 170(3), 887–905 (2016)Google Scholar
- 15.Kiwiel, K.C.: Bundle Methods for Convex Minimization with Partially Inexact Oracles. Technical Report, Systems Research Institute, Polish Academy of Sciences (April 2010)Google Scholar
- 16.Konnov, I.V.: The application of a linearization method to solving nonsmooth equilibrium problems. Russ. Math. 40(12), 54–62 (1996)Google Scholar
- 30.Shen, J., Pang, L.P.: An approximate bundle method for solving variational inequalities. Commun. Optim. Theory 1, 1–18 (2012)Google Scholar