An Accelerated Proximal Algorithm for the Difference of Convex Programming

被引：0

作者：

Shen, Feichao ^{[1
]}

Zhang, Ying ^{[2
]}

Wang, Xueyong ^{[3
]}

机构：

[1] Guilin Univ Elect Technol, Sch Math Comp Sci, Guilin 541004, Guangxi, Peoples R China

[2] Shandong Water Conservancy Vocat Coll, Sch Basic Teaching, Rizhao 276800, Shandong, Peoples R China

[3] Qufu Normal Univ, Sch Management, Rizhao 276800, Shandong, Peoples R China

来源：

MATHEMATICAL PROBLEMS IN ENGINEERING | 2021年 / 2021卷 / 2021期

关键词：

32;

D O I：

10.1155/2021/9994015

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper, we propose an accelerated proximal point algorithm for the difference of convex (DC) optimization problem by combining the extrapolation technique with the proximal difference of convex algorithm. By making full use of the special structure of DC decomposition and the information of stepsize, we prove that the proposed algorithm converges at rate of O(1/k(2)) under milder conditions. The given numerical experiments show the superiority of the proposed algorithm to some existing algorithms.

引用

页数：9

共 50 条

[21] Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
Alvarez, Felipe
Lopez, Julio
[J]. OPTIMIZATION, 2016, 65 (09) : 1757 - 1779
[22] Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm
Cominetti, R
Courdurier, M
[J]. SIAM JOURNAL ON OPTIMIZATION, 2003, 13 (03) : 745 - 765
[23] Accelerated Difference of Convex functions Algorithm and its Application to Sparse Binary Logistic Regression
Duy Nhat Phan
Hoai Minh Le
Hoai An Le Thi
[J]. PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1369 - 1375
[24] AN ALGORITHM FOR CONVEX-PROGRAMMING
HANSON, MA
[J]. AUSTRALIAN JOURNAL OF STATISTICS, 1963, 5 (01): : 14 - 19
[25] Nonlinear Proximal Decomposition Method for Convex Programming
M. Kyono
M. Fukushima
[J]. Journal of Optimization Theory and Applications, 2000, 106 : 357 - 372
[26] Nonlinear proximal decomposition method for convex programming
Kyono, M
Fukushima, M
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 106 (02) : 357 - 372
[27] Accelerated Proximal Gradient Methods for Nonconvex Programming
Li, Huan
Lin, Zhouchen
[J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
[28] A class of smooth semi-supervised SVM by difference of convex functions programming and algorithm
Yang, Liming
Wang, Laisheng
[J]. KNOWLEDGE-BASED SYSTEMS, 2013, 41 : 1 - 7
[29] A Maximum-Likelihood TDOA Localization Algorithm Using Difference-of-Convex Programming
Ma, Xiuxiu
Ballal, Tarig
Chen, Hui
Aldayel, Omar
Al-Naffouri, Tareq Y.
[J]. IEEE SIGNAL PROCESSING LETTERS, 2021, 28 : 309 - 313
[30] ACCELERATED FIRST-ORDER PRIMAL-DUAL PROXIMAL METHODS FOR LINEARLY CONSTRAINED COMPOSITE CONVEX PROGRAMMING
Xu, Yangyang
[J]. SIAM JOURNAL ON OPTIMIZATION, 2017, 27 (03) : 1459 - 1484

← 1 2 3 4 5 →