Split proximal linearized algorithm and convergence theorems for the split DC program

In this paper, we study the split DC program by using the split proximal linearized algorithm. Further, linear convergence theorem for the proposed algorithm is established under suitable conditions. As applications, we first study the DC program (DCP). Finally, we give numerical results for the pro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of inequalities and applications Ročník 2019; číslo 1; s. 1 - 16
Hlavní autori: Chuang, Chih-Sheng, Chen, Chi-Ming
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cham Springer International Publishing 22.05.2019
Springer Nature B.V
SpringerOpen
Predmet:
Algorithms
Analysis
Applications of Mathematics
Convergence
DC program
Linearization
Mathematics
Mathematics and Statistics
Proximal linearized algorithm
Strongly monotonicity
Theorems
Proximal linearized algorithm
49M30
49J53
49J50
90C26
49M37
DC program
Strongly monotonicity
ISSN:1029-242X, 1025-5834, 1029-242X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we study the split DC program by using the split proximal linearized algorithm. Further, linear convergence theorem for the proposed algorithm is established under suitable conditions. As applications, we first study the DC program (DCP). Finally, we give numerical results for the proposed convergence results.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1029-242X
1025-5834
1029-242X
DOI:10.1186/s13660-019-2084-9