Convergence Rate Analysis of the Proximal Difference of the Convex Algorithm

Xueyong Wang, Ying Zhang, Haibin Chen and Xipeng Kou

Mathematical Problems in Engineering, 2021, vol. 2021, 1-5

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/5629868.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/5629868.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5629868

DOI: 10.1155/2021/5629868

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().