A New Accelerated Proxiaml Point Algorithm For Minimizing Smooth DC Functions

Several optimization schemes have been known for convex optimization problems. A significant progress to go beyond convexity was made by considering the class of functions representable as difference of convex functions which constitute the backbone of nonconvex programming and global optimization. In this paper, we first, introduce a new algorithm to minimize smooth difference of convex functions that accelerate the convergence of the classical proximal point algorithm. One of the main drawbacks of proximal point methods is their speed of convergence, which is known to be slow. Then, we present a new accelerate proximal point algorithm, which preserves the computational simplicity of proximal point algorithm but with a global rate of convergence which is proven to be significantly better, both theoretically and practically. Convergence of the algorithms is proved and the rate of convergence is analyzed under the Lipschitz continuous gradient of the second term of objective function.

کلیدواژه ها:

DC function ، Global rate of convergence ، Lipschitz continuous gradient ، Proximal point algorithm