Worst case complexity bounds for linesearch-type derivative-free algorithms

DOI10.1007/s10957-024-02519-xMaRDI QIDQ6636792

Stefano Lucidi, Giampaolo Liuzzi, Andrea Brilli, Morteza Kimiaei

Publication date: 12 November 2024

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

zbMATH Keywords

unconstrained optimizationderivative-free optimizationline searchworst case complexity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

This page was built for publication: Worst case complexity bounds for linesearch-type derivative-free algorithms