In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail.
DI FIORE, C., Fanelli, S., Zellini, P. (2007). Low complexity secant quasi-Newton minimization algorithms for nonconvex functions. INTERNATIONAL JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 210, 167-174 [10.1016/j.cam.2006.10.060].
Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
DI FIORE, CARMINE;FANELLI, STEFANO;ZELLINI, PAOLO
2007-01-01
Abstract
In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
low_compl.pdf
accesso aperto
Descrizione: Articolo
Dimensione
204.51 kB
Formato
Adobe PDF
|
204.51 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
