Solving in an efficient and robust way an unconstrained optimization problem may prove quite hard in certain difficult situations. Typical examples are highly nonlinear problems, ill-conditioned and badly scaled problems. Particularly in these situations, it may be useful to compute a curvilinear trajectory and follow it by curvilinear searches with the aim to reach the solution in few long steps. In this paper, we proposed an approach for computing a suitable curvilinear trajectory, based on the knowledge of the third order derivatives of the objective function. The numerical implementation of this approach was made possible by Automatic Differentiation techniques. Some preliminary numerical results are very encouraging, especially in the case of very ill-conditioned and badly scaled problems. © 2001 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint, a member of the Taylor & Francis Group.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||A curvilinear search algorithm for unconstrained optimization by automatic differentiation|
|Data di pubblicazione:||2001|
|Appare nelle tipologie:||1.1 Articolo in rivista|