In this article, we review methods for the solution of unconstrained optimization problems, where the number of unknowns is large.We first describe the basics of unconstrained optimization, then we consider the iterative methods that are commonly used within largescale optimization. The techniques described here explicitly use information on the objective function and some of its derivatives. Extensions to effective quasi-Newtonmethods for partially separable optimization are detailed.
Methods for large scale unconstrained optimization
FASANO, Giovanni
2010-01-01
Abstract
In this article, we review methods for the solution of unconstrained optimization problems, where the number of unknowns is large.We first describe the basics of unconstrained optimization, then we consider the iterative methods that are commonly used within largescale optimization. The techniques described here explicitly use information on the objective function and some of its derivatives. Extensions to effective quasi-Newtonmethods for partially separable optimization are detailed.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
eorms0521.pdf
non disponibili
Tipologia:
Documento in Pre-print
Licenza:
Licenza non definita
Dimensione
512.01 kB
Formato
Adobe PDF
|
512.01 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.