Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems

Abstract

A proximal bundle algorithm is proposed for solving unconstrained nonsmooth nonconvex optimization problems. At each iteration, using already generated information, the algorithm defines a convex model of the augmented objective function. Then by solving a quadratic subproblem a new candidate iterate is obtained and the algorithm is repeated. The novelty in our approach is that the objective function can be any arbitrary locally Lipschitz function without any additional assumptions. The global convergence, starting from any point, is also studied. At the end, some encouraging numerical results with a MATLAB implementation are reported. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.