Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations-Reference-Cited by-同舟云学术

Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations

Published:2021-10-07 Issue:8 Volume:40 Page:
ISSN:2238-3603
Container-title:Computational and Applied Mathematics
language:en
Short-container-title:Comp. Appl. Math.

Author:

Grapiglia Geovani N.^ORCID,Chorobura Flávia

Funder

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

https://link.springer.com/content/pdf/10.1007/s40314-021-01621-4.pdf

Reference31 articles.

1. Bergou EH, Diouane Y, Kungurtsev V (2020) Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems. J Optim Theory Appl 185:927–944

2. Birgin EG, Martínez JM (2020) Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. arXiv: 2012.13251 [math.NA]

3. Birgin EG, Gardenghi JL, Marcondes DS, Martínez JM (2021) Accelerated derivative-free spectral residual method for nonlinear systems of equations. arXiv: 2104.13447 [math.NA]

4. Cartis C, Gould NIM, Toint PhL (2011) On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J Optim 21:1721–1739

5. Cheng W, Li D-H (2009) A derivative-free nonmonotone line search and its application to the spectral residual method. IMA J Numer Anal 29:814–825

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Global Complexity of a Derivative-Free Levenberg-Marquardt Algorithm via Orthogonal Spherical Smoothing;Journal of Scientific Computing;2024-08-06