Inexact Version of Bregman Proximal Gradient Algorithm
Author
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-04-01
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
The Bregman Proximal Gradient (BPG) algorithm is an algorithm for minimizing the sum of two convex functions, with one being nonsmooth.
The supercoercivity of the objective function is necessary for the convergence of this algorithm precluding its use in many applications.
In this paper, we give an inexact version of the BPG algorithm while circumventing the condition of supercoercivity by replacing it with a simple condition on the parameters of the problem.
Our study covers the existing results, while giving other.
American Psychological Association (APA)
Kabbadj, S.. 2020. Inexact Version of Bregman Proximal Gradient Algorithm. Abstract and Applied Analysis،Vol. 2020, no. 2020, pp.1-11.
https://search.emarefa.net/detail/BIM-1119856
Modern Language Association (MLA)
Kabbadj, S.. Inexact Version of Bregman Proximal Gradient Algorithm. Abstract and Applied Analysis No. 2020 (2020), pp.1-11.
https://search.emarefa.net/detail/BIM-1119856
American Medical Association (AMA)
Kabbadj, S.. Inexact Version of Bregman Proximal Gradient Algorithm. Abstract and Applied Analysis. 2020. Vol. 2020, no. 2020, pp.1-11.
https://search.emarefa.net/detail/BIM-1119856
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1119856