High-order methods beyond the classical complexity bounds : inexact high-order proximal-point methods
Bron
Mathematical programming - ISSN 0025-5610-208:1-2 (2024) p. 365-407
Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions
Bron
Applied mathematics and computation - ISSN 0096-3003-464 (2024) p. 1-18
Bregman finito/miso for nonconvex regularized finite sum minimization without lipschitz gradient continuity
Bron
SIAM journal on optimization - ISSN 1052-6234-32:3 (2022) p. 2230-2262
Block Bregman majorization minimization with extrapolation
Bron
SIAM journal on mathematics of data science - ISSN 2577-0187-4:1 (2022) p. 1-25
High-order methods beyond the classical complexity bounds, II : inexact high-order proximal-point methods with segment search
Bron
arXiv, 2021,28 p.