On the worst-case evaluation complexity of non-monotone line search algorithms
Crossref DOI link: https://doi.org/10.1007/s10589-017-9928-3
Published Online: 2017-07-26
Published Print: 2017-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Grapiglia, Geovani N. http://orcid.org/0000-0003-3284-3371
Sachs, Ekkehard W.
Funding for this research was provided by:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (401288/2014-5)
License valid from 2017-07-26