Theoretical Aspect of Diagonal Bregman Proximal Methods
In this paper, we propose and study a diagonal inexact version of Bregman proximal methods, to solve convex optimization problems with and without constraints. The proposed method forms a unified framework for existing algorithms by providing others.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2020/3108056 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|