Proximal point type algorithms with relaxed and inertial effects beyond convexity
Sorin‐Mihai Grad, Felipe Lara, R. T. Marcavillaca · Optimization · 2024
We show that the recent relaxed-inertial proximal point algorithm due to Attouch and Cabot remains convergent when the function to be minimized is not convex, being only endowed with certain generalized convexity properties. Numerical experiments showcase the improvements brought by the relaxation and inertia features to the standard proximal point method in this setting, too.