On the worst-case evaluation complexity of non-monotone line search algorithms

From MaRDI portal
Publication:1694392

DOI10.1007/s10589-017-9928-3zbMath1388.90111OpenAlexW2739128850MaRDI QIDQ1694392

Ekkehard W. Sachs, Geovani Nunes Grapiglia

Publication date: 1 February 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-017-9928-3




Related Items


Uses Software


Cites Work


This page was built for publication: On the worst-case evaluation complexity of non-monotone line search algorithms