Finite termination of the proximal point algorithm in Banach spaces

In this paper, we show that the convex optimization problem can be solved by the proximal point algorithm in a finite number of steps under the assumption that the solution set is a set of weak sharp minima.