< Terug naar vorige pagina

Publicatie

Forward-backward envelope for the sum of two nonconvex functions : further properties and nonmonotone line-search algorithms

Tijdschriftbijdrage - Tijdschriftartikel

© 2018 Society for Industrial and Applied Mathematics. We propose ZeroFPR, a nonmonotone linesearch algorithm for minimizing the sumof two nonconvex functions, one of which is smooth and the other possibly nonsmooth. ZeroFPRis the first algorithm that, despite being fit for fully nonconvex problems and requiring only theblack-box oracle of forward-backward splitting (FBS)|namely evaluations of the gradient of thesmooth term and of the proximity operator of the nonsmooth one|achieves superlinear convergencerates under mild assumptions at the limit point when the linesearch directions satisfy a Dennis{Moŕecondition, and we show that this is the case for Broyden's quasi-Newton directions. Our approach isbased on the forward-backward envelope (FBE), an exact and strictly continuous penalty functionfor the original cost. Extending previous results we show that, despite being nonsmooth for fullynonconvex problems, the FBE still enjoys favorable first-and second-order properties which are keyfor the convergence results of ZeroFPR. Our theoretical results are backed up by promising numericalsimulations. On large-scale problems, by computing linesearch directions using limited-memoryquasi-Newton updates our algorithm greatly outperforms FBS and its accelerated variant (AFBS).
Tijdschrift: SIAM Journal on Optimization
ISSN: 1052-6234
Issue: 3
Volume: 28
Pagina's: 2274 - 2303
Jaar van publicatie:2018
BOF-keylabel:ja
IOF-keylabel:ja
BOF-publication weight:2
CSS-citation score:2
Authors from:Higher Education
Toegankelijkheid:Open