We present a bundle method for solving nonsmooth convex equilibrium problems based on the auxiliary problem principle. First, we consider a general algorithm that we prove to be convergent. Then we explain how to make this algorithm implementable. The strategy is to approximate the nonsmooth convex functions by piecewise linear convex functions in such a way that the subproblems are easy to solve and the convergence is preserved.
|Effective start/end date||30/09/04 → …|
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.