caa a22 4500 475769368 CHVBK 20180406123615.0 cr unu---uuuuu 170329e20000401xx s 000 0 eng 10.1007/s101070050115 doi (NATIONALLICENCE)springer-10.1007/s101070050115 Powell M.J.D. Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Silver Street, Cambridge CB3 9EW, England, GB aut On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables [Elektronische Daten] [M.J.D. Powell] Abstract. : Let the DFP algorithm for unconstrained optimization be applied to an objective function that has continuous second derivatives and bounded level sets, where each line search finds the first local minimum. It is proved that the calculated gradients are not bounded away from zero if there are only two variables. The new feature of this work is that there is no need for the objective function to be convex. Springer-Verlag Berlin Heidelberg, 2000 Key words: convergence theory - unconstrained optimization - variable metric algorithms nationallicence https://doi.org/10.1007/s101070050115 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s101070050115 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Powell M.J.D. Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Silver Street, Cambridge CB3 9EW, England, GB aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer