Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization

DOI10.13140/RG.2.2.22451.40486MaRDI QIDQ6515293arXivFDO

Authors Geoffroy Leconte, D. Orban

Published in arXiv

Full work available at URL https://doi.org/10.13140/RG.2.2.22451.40486

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Derivative-free methods and methods using generalized derivatives (90C56)

This page was built for publication: Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6515293)