Skip to main content

OPTIMIZATION OVER NONLINEAR MODEL SPACES: WHERE DISCRETE MEETS CONTINUOUS OPTIMIZATION

PCI2024-155024-2

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Transferencia y Colaboración
Subprogram Subprograma Estatal para impulsar la Colaboración en y entre los Sectores Público y Privado
Call Proyectos Programación Conjunta Internacional
Call year 2024
State Plan 2024-2027 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE SEVILLA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 1
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Nonmonotone subgradient methods based on a local descent lemma

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • Pérez-Aros, Pedro
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
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.