A BUNDLE METHOD FOR SOLVING CONVEX NON-SMOOTH MINIMIZATION PROBLEMS

Abstract

Abstract. Numerical experiences show that bundle methods are very efficient for solving convex non-smooth optimization problems. In this paper we describe briefly the mathematical background of a bundle method and discuss practical aspects for the numerical implementation. Further, we give a detailed documentation of our implementation and report about numerical tests. 1