Convergence Rate Analysis of the Proximal Difference of the Convex Algorithm. (4th January 2021)

• Record Type: Journal Article
• Authors: Wang, Xueyong; Zhang, Ying; Chen, Haibin; Kou, Xipeng
• Other Names: Chen Chuanjun Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-01-04
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/5629868
• Languages: English
• ISSNs: 1024-123X

Abstract

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.