Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation

Jie Zhang () and Xinmin Yang ()
Additional contact information
Jie Zhang: Chongqing University of Posts and Telecommunications
Xinmin Yang: Chongqing Normal University

Journal of Global Optimization, 2025, vol. 92, issue 2, No 6, 410 pages

Abstract: Abstract In this paper, we propose a Bregman proximal iteratively reweighted algorithm with extrapolation based on block coordinate update aimed at solving a class of optimization problems which is the sum of a smooth possibly nonconvex loss function and a general nonconvex regularizer with a separable structure. The proposed algorithm can be used to solve the $$\ell _p(0

Keywords: Iteratively reweighted algorithm; Bregman distance; Block coordinate update; Extrapolation; Kurdyka–Łojasiewicz property (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-024-01451-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jglopt:v:92:y:2025:i:2:d:10.1007_s10898-024-01451-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-024-01451-8

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().