Nonmonotone subgradient methods based on a local descent lemma

F. J. Aragón Artacho, R. Campoy García, P. Pérez Aros, D. Torregrosa Belén

In this talk, we extend the context of nonmonotone descent methods to a general class of nonsmooth and nonconvex functions satisfying a nonsmooth and local version of the descent lemma. Under this assumption, we propose a general subgradient method with a nonmonotone linesearch and prove subsequential convergence to stationary points. Our approach applies to a broad class of problems, including those involving forward–backward envelopes and augmented Lagrangians. We also report numerical results illustrating the advantages of the proposed method compared to existing algorithms.

Palabras clave: Optimization, Descent methods, nonsmooth

GT Optimización Continua II
2 de septiembre de 2026  15:30
Aula 30

R. Campoy García, S. B. Lindstrom, C. López Pastor

L. Huerga Pastor, B. Jiménez Martín, V. Novo Sanjurjo

F. J. Toledo Melero, A. Laudani, V. Herranz, X. Moreno-Vassart, V. Galiano

M. Rodríguez Álvarez, J. E. Martínez Legaz, J. Vicente Pérez