Nonsmooth spectral gradient methods for unconstrained optimization

To solve nonsmooth unconstrained minimization problems, we combine the spectral choice of step length with two well-established subdifferential-type schemes: the gradient sampling method and the simplex gradient method. We focus on the interesting case in which the objective function is continuously...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Milagros Loreto, Hugo Aponte, Debora Cores, Marcos Raydan
Formato: article
Lenguaje:EN
Publicado: Elsevier 2017
Materias:
Acceso en línea:https://doaj.org/article/09769c1ca2fc49daa0950264b364bf55
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!