Theoretical Aspect of Diagonal Bregman Proximal Methods

S. Kabbadj

Journal of Applied Mathematics, 2020, vol. 2020, issue 1

Abstract: 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2020/3108056

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2020:y:2020:i:1:n:3108056

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().