Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization

In this paper, we propose a smoothing randomized block-coordinate proximal gradient (S-RBCPG) algorithm and a Bregman randomized block-coordinate proximal gradient (B-RBCPG) algorithm for minimizing the sum of two nonconvex nonsmooth functions, one of which is block separable. The pivotal tool of ou...

Full description

Saved in:

Bibliographic Details
Published in:	Numerical algorithms Vol. 100; no. 1; pp. 395 - 424
Main Authors:	Li, Xue, Bian, Wei
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2025 Springer Nature B.V
Subjects:	Algebra Algorithms Computer Science Convergence Inverse problems Machine learning Mapping Numeric Computing Numerical Analysis Optimization Smoothing Smoothness Theory of Computation Kurdyka-Łojasiewicz property 90C30 65K05 Relative smoothness Block-coordinate 90C26 Smoothing method Nonsmooth nonconvex optimization
ISSN:	1017-1398, 1572-9265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!