New inertial proximal gradient methods for unconstrained convex optimization problems

The proximal gradient method is a highly powerful tool for solving the composite convex optimization problem. In this paper, firstly, we propose inexact inertial acceleration methods based on the viscosity approximation and proximal scaled gradient algorithm to accelerate the convergence of the algo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of inequalities and applications Jg. 2020; H. 1; S. 1 - 18
Hauptverfasser: Duan, Peichao, Zhang, Yiqun, Bu, Qinxiong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 07.12.2020
Springer Nature B.V
SpringerOpen
Schlagworte:
Algorithms
Alternated inertial acceleration
Analysis
Applications of Mathematics
Computational geometry
Convergence
Convex analysis
Convex optimization
Convexity
Inertial acceleration
Mathematics
Mathematics and Statistics
Optimization
Proximal operator
Viscosity approximation
47H10
Alternated inertial acceleration
Inertial acceleration
Convex optimization
90C25
47H09
65K10
Proximal operator
47J25
Viscosity approximation
ISSN:1029-242X, 1025-5834, 1029-242X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The proximal gradient method is a highly powerful tool for solving the composite convex optimization problem. In this paper, firstly, we propose inexact inertial acceleration methods based on the viscosity approximation and proximal scaled gradient algorithm to accelerate the convergence of the algorithm. Under reasonable parameters, we prove that our algorithms strongly converge to some solution of the problem, which is the unique solution of a variational inequality problem. Secondly, we propose an inexact alternated inertial proximal point algorithm. Under suitable conditions, the weak convergence theorem is proved. Finally, numerical results illustrate the performances of our algorithms and present a comparison with related algorithms. Our results improve and extend the corresponding results reported by many authors recently.
Bibliographie: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-020-02522-6