AN ALTERNATING LINEARIZATION BUNDLE METHOD FOR A CLASS OF NONCONVEX OPTIMIZATION PROBLEM WITH INEXACT INFORMATION

We propose an alternating linearization bundle method for minimizing the sum of a nonconvex function and a convex function. The convex function is assumed to be "simple" in the sense that finding its proximal-like point is relatively easy. The nonconvex function is known through oracles which provide inexact information. The errors in function values and subgradient evaluations might be unknown, but are bounded by universal constants. We examine an alternating linearization bundle method in this setting and obtain reasonable convergence properties. Numerical results show the good performance of the method.