Photo from wikipedia
In this paper, we propose an accelerated proximal point algorithm for the difference of convex (DC) optimization problem by combining the extrapolation technique with the proximal difference of convex algorithm.… Click to show full abstract
In this paper, we propose an accelerated proximal point algorithm for the difference of convex (DC) optimization problem by combining the extrapolation technique with the proximal difference of convex algorithm. By making full use of the special structure of DC decomposition and the information of stepsize, we prove that the proposed algorithm converges at rate of under milder conditions. The given numerical experiments show the superiority of the proposed algorithm to some existing algorithms.
Keywords:
difference convex;
accelerated proximal;
algorithm;
algorithm difference
Journal Title: Mathematical Problems in Engineering
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematical Problems in Engineering
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!