Penalty—proximal methods in convex programming

An implementable algorithm for constrained nonsmooth convex programs is given. This algorithm combines exterior penalty methods with the proximal method. In the case of a linear program, the convergence is finite.