RUA. Repositorio Institucional de la Universidad de Alicante
Publication
Otros (Other)
Nonmonotone subgradient methods based on a local descent lemma
In this paper we present a nonmonotone line search subgradient algorithm tailored to upper-C2 functions. This is a family of nonsmooth and nonconvex functions that satisfies a nonsmooth and local version of the descent lemma, making them suitable for line searches. We prove subsequential convergence of the proposed algorithm to a stationary point of the optimization problem. Our approach allows us to cover the setting of various subgradient algorithms, including Newton and quasi-Newton methods. In addition, we propose a specification of the general scheme, named Self-adaptive nonmonotone subgradient method (SNSM), which automatically updates the parameters of the line search. Particular attention is paid to the minimum sum-of-squares clustering problem, for whichwe provide a concrete implementation of SNSM. We conclude with some numerical experiments where we exhibit the advantages of SNSM in comparison with some known algorithms.
Project:
AEI / Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023 PID2022-136399NB-C21
,
AEI / Plan Estatal de Investigación Científica y Técnica y de Innovación 2024-2027 PID2025-168246NB-I00
,
AEI / Plan Estatal de Investigación Científica y Técnica y de Innovación 2024-2027 PCI2024-155024-2
View at: https://hdl.handle.net/10045/171448