Convergence Rate Analysis of the Proximal Difference of the Convex Algorithm
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 pro...
Main Authors: | Xueyong Wang, Ying Zhang, Haibin Chen, Xipeng Kou |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2021/5629868 |
Similar Items
-
An Accelerated Proximal Algorithm for the Difference of Convex Programming
by: Feichao Shen, et al.
Published: (2021-01-01) -
Convex programming for optimal control : algorithms and convergence rates
by: Sentieiro, Joao Jose Dos Santos
Published: (1986) -
Linear Convergence Rate of Splitting Algorithms for Multi-Block Constrained Convex Minimizations
by: Xiaoge Deng, et al.
Published: (2020-01-01) -
Convergence Analysis of the Relaxed Proximal Point Algorithm
by: Min Li, et al.
Published: (2013-01-01) -
Proximal Splitting Algorithms for Disparity Estimation Using Convex Relaxation
by: Hiltunen, Sonja
Published: (2011)