In this paper, we deal with matrix-free preconditioners for nonlinear conjugate gradient (NCG) methods. In particular, we review proposals based on quasi-Newton updates, and either satisfying the secant equation or a secant-like equation at some of the previous iterates. Conditions are given proving that, in some sense, the proposed preconditioners also approximate the inverse of the Hessian matrix. In particular, the structure of the preconditioners depends both on low-rank updates along with some specific parameters. The low-rank updates are obtained as by-product of NCG iterations. Moreover, we consider the possibility to embed damped techniques within a class of preconditioners based on quasi-Newton updates. Damped methods have proved to be effective to enhance the performance of quasi- Newton updates, in those cases where the Wolfe linesearch conditions are hardly fulfilled. The purpose is to extend the idea behind damped methods also to improve NCG schemes, following a novel line of research in the literature. The results, which summarize an extended numerical experience using large-scale CUTEst problems, is reported, showing that these approaches can considerably improve the performance of NCG methods.
Quasi-Newton based preconditioning and damped quasi-Newton schemes for nonlinear conjugate gradient methods / Al-Baali, Mehiddin; Caliciotti, Andrea; Fasano, Giovanni; Roma, Massimo. - STAMPA. - 235:(2018), pp. 1-21. (Intervento presentato al convegno Fourth international conference on numerical analysis and optimization: Theory, methods, applications and technology transfer (NAOIV) tenutosi a Sultan Quabos University, Muscat, Oman) [10.1007/978-3-319-90026-1_1].
Quasi-Newton based preconditioning and damped quasi-Newton schemes for nonlinear conjugate gradient methods
Andrea Caliciotti;Massimo Roma
2018
Abstract
In this paper, we deal with matrix-free preconditioners for nonlinear conjugate gradient (NCG) methods. In particular, we review proposals based on quasi-Newton updates, and either satisfying the secant equation or a secant-like equation at some of the previous iterates. Conditions are given proving that, in some sense, the proposed preconditioners also approximate the inverse of the Hessian matrix. In particular, the structure of the preconditioners depends both on low-rank updates along with some specific parameters. The low-rank updates are obtained as by-product of NCG iterations. Moreover, we consider the possibility to embed damped techniques within a class of preconditioners based on quasi-Newton updates. Damped methods have proved to be effective to enhance the performance of quasi- Newton updates, in those cases where the Wolfe linesearch conditions are hardly fulfilled. The purpose is to extend the idea behind damped methods also to improve NCG schemes, following a novel line of research in the literature. The results, which summarize an extended numerical experience using large-scale CUTEst problems, is reported, showing that these approaches can considerably improve the performance of NCG methods.File | Dimensione | Formato | |
---|---|---|---|
Al-Baali_Quasi-Newton-based_2018.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
681.5 kB
Formato
Adobe PDF
|
681.5 kB | Adobe PDF | Contatta l'autore |
Al-Baali_Postpritn-Quasi-Newton-based_2018.pdf
Open Access dal 02/06/2019
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
408.12 kB
Formato
Adobe PDF
|
408.12 kB | Adobe PDF | |
Al-Baali_Frontespizio-indice_2018.pdf.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
190.68 kB
Formato
Adobe PDF
|
190.68 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.