Convergence Rate Analysis of the Proximal Difference of the Convex Algorithm-Reference-Cited by-同舟云学术

Convergence Rate Analysis of the Proximal Difference of the Convex Algorithm

Published:2021-01-04 Issue: Volume:2021 Page:1-5
ISSN:1563-5147
Container-title:Mathematical Problems in Engineering
language:en
Short-container-title:Mathematical Problems in Engineering

Author:

Wang Xueyong¹,Zhang Ying²,Chen Haibin¹^ORCID,Kou Xipeng³

Affiliation:

1. School of Management Science, Qufu Normal University, Rizhao, Shandong 276800, China

2. School Basic Teaching, Shandong Water Conservancy Vocat Coll, Rizhao, Shandong 276800, China

3. College of Mathematics Physics and Data Science, Chongqing University of Science and Technology, Chongqing 401331, China

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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

General Engineering,General Mathematics

Link

http://downloads.hindawi.com/journals/mpe/2021/5629868.pdf

Reference19 articles.

1. Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks

2. A New Decomposition Method for Multiuser DC-Programming and Its Applications

3. Minimization of $\ell_{1-2}$ for Compressed Sensing

4. DC formulations and algorithms for sparse optimization problems

5. Proximal bundle methods for nonsmooth DC programming;W. D. Oliveira;J Global Optim,2019

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Accelerated Proximal Algorithm for the Difference of Convex Programming;Mathematical Problems in Engineering;2021-04-24