In this paper we consider the issue of computing negative curvature directions, for nonconvex functions, within Newton-Krylov methods for large scale unconstrained optimization. In the last decades this issue has been widely investigated in the literature, and different approaches have been proposed. We focus on the well known SYMMBK method introduced for solving large scale symmetric possibly indefinite linear systems [5,9,11,28], and show how to exploit it to yield an effective negative curvature direction in optimization frameworks. The distinguishing feature of our proposal is that the computation of negative curvatures is basically carried out as by-product of SYMMBK procedure, without storing no more than one additional vector. Hence, no explicit matrix factorization or matrix storage is required. An extensive numerical experimentation has been performed on CUTEst problems; the obtained results have been analyzed also through novel profiles (Quality Profiles) which highlighted the good capability of the algorithms which use negative curvature directions to determine better local minimizers.

Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods

Giovanni Fasano
;
In corso di stampa

Abstract

In this paper we consider the issue of computing negative curvature directions, for nonconvex functions, within Newton-Krylov methods for large scale unconstrained optimization. In the last decades this issue has been widely investigated in the literature, and different approaches have been proposed. We focus on the well known SYMMBK method introduced for solving large scale symmetric possibly indefinite linear systems [5,9,11,28], and show how to exploit it to yield an effective negative curvature direction in optimization frameworks. The distinguishing feature of our proposal is that the computation of negative curvatures is basically carried out as by-product of SYMMBK procedure, without storing no more than one additional vector. Hence, no explicit matrix factorization or matrix storage is required. An extensive numerical experimentation has been performed on CUTEst problems; the obtained results have been analyzed also through novel profiles (Quality Profiles) which highlighted the good capability of the algorithms which use negative curvature directions to determine better local minimizers.
In corso di stampa
to be assigned
File in questo prodotto:
File Dimensione Formato  
paperFAPIRO.pdf

accesso aperto

Tipologia: Documento in Pre-print
Licenza: Accesso libero (no vincoli)
Dimensione 718.17 kB
Formato Adobe PDF
718.17 kB Adobe PDF Visualizza/Apri

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10278/5046040
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact