Author
Roberts, L
Cartis, C
Journal title
Mathematical Programming Computation
DOI
10.1007/s12532-019-00161-7
Issue
4
Volume
11
Last updated
2024-05-10T14:27:33.117+01:00
Page
631-674
Abstract
We present DFO-GN, a derivative-free version of the Gauss–Newton method for solving nonlinear least-squares problems. DFO-GN uses linear interpolation of residual values to build a quadratic model of the objective, which is then used within a typical derivative-free trust-region framework. We show that DFO-GN is globally convergent and requires at most {\mathcal {O}}(\epsilon ^{-2}) iterations to reach approximate first-order criticality within tolerance \epsilon. We provide an implementation of DFO-GN and compare it to other state-of-the-art derivative-free solvers that use quadratic interpolation models. We demonstrate numerically that despite using only linear residual models, DFO-GN performs comparably to these methods in terms of objective evaluations. Furthermore, as a result of the simplified interpolation procedure, DFO-GN has superior runtime and scalability. Our implementation of DFO-GN is available at https://github.com/numericalalgorithmsgroup/dfogn ( https://doi.org/10.5281/zenodo.2629875)
Symplectic ID
1002910
Favourite
Off
Publication type
Journal Article
Publication date
20 May 2019
Please contact us with feedback and comments about this page. Created on 23 May 2019 - 15:12.