Inexact version of Bregman proximal gradient algorithm (Q2198034)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7245152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inexact version of Bregman proximal gradient algorithm |
scientific article; zbMATH DE number 7245152 |
Statements
Inexact version of Bregman proximal gradient algorithm (English)
0 references
8 September 2020
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0.90949667
0 references
0.90613866
0 references
0.90121204
0 references
0.89937985
0 references
0.89185303
0 references
0 references
0.8876138
0 references
0.8854331
0 references
0.8852397
0 references
