convergence rate analysis
Recently Published Documents


TOTAL DOCUMENTS

67
(FIVE YEARS 18)

H-INDEX

15
(FIVE YEARS 3)

2021 ◽  
Vol 2021 ◽  
pp. 1-5
Author(s):  
Xueyong Wang ◽  
Ying Zhang ◽  
Haibin Chen ◽  
Xipeng Kou

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.


2020 ◽  
Vol 20 (21) ◽  
pp. 13150-13160 ◽  
Author(s):  
Said Kouachi ◽  
Sateeshkrishna Dhuli ◽  
Yatindra Nath Singh

Sign in / Sign up

Export Citation Format

Share Document