Bregman finito/miso for nonconvex regularized finite sum minimization without lipschitz gradient continuity

Source
SIAM journal on optimization - ISSN 1052-6234-32:3 (2022) p. 2230-2262
Author(s)

Block Bregman majorization minimization with extrapolation

Source
SIAM journal on mathematics of data science - ISSN 2577-0187-4:1 (2022) p. 1-25
Author(s)
    Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis, Masoud Ahookhosh, Panagiotis Patrinos
Citation link

High-order methods beyond the classical complexity bounds, II : inexact high-order proximal-point methods with segment search

Source
arXiv, 2021,28 p.
Author(s)

High-order methods beyond the classical complexity bounds, I : inexact high-order proximal-point methods

Source
arXiv, 2021,28 p.
Author(s)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity

Source
arXiv, 2021,26 p.
Author(s)