Photo by fkaregan from unsplash
In this paper, we study the convergence rate of the proximal difference of the convex algorithm for the problem with a strong convex function and two convex functions. By making… Click to show full abstract
In this paper, we study the convergence rate of the proximal difference of the convex algorithm for the problem with a strong convex function and two convex functions. By making full use of the special structure of the difference of convex decomposition, we prove that the convergence rate of the proximal difference of the convex algorithm is linear, which is measured by the objective function value.
Keywords:
difference convex;
proximal difference;
convex;
convex algorithm;
convergence rate
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!