Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: De Marchi, Alberto
Format: Preprint
Veröffentlicht: 2022
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2211.04827
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914676388921344
author De Marchi, Alberto
author_facet De Marchi, Alberto
contents We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal gradient methods, which often rely on a line search procedure as globalization mechanism. We consider an adaptive nonmonotone proximal gradient scheme based on an averaged merit function and establish asymptotic convergence guarantees under weak assumptions, delivering results on par with the monotone strategy. Global worst-case rates for the iterates and a stationarity measure are also derived. Finally, a numerical example indicates the potential of nonmonotonicity and spectral approximations.
format Preprint
id arxiv_https___arxiv_org_abs_2211_04827
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Proximal gradient methods beyond monotony
De Marchi, Alberto
Optimization and Control
We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal gradient methods, which often rely on a line search procedure as globalization mechanism. We consider an adaptive nonmonotone proximal gradient scheme based on an averaged merit function and establish asymptotic convergence guarantees under weak assumptions, delivering results on par with the monotone strategy. Global worst-case rates for the iterates and a stationarity measure are also derived. Finally, a numerical example indicates the potential of nonmonotonicity and spectral approximations.
title Proximal gradient methods beyond monotony
topic Optimization and Control
url https://arxiv.org/abs/2211.04827