Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization
From MaRDI portal
Publication:6515293
DOI10.13140/RG.2.2.22451.40486arXiv2312.15151MaRDI QIDQ6515293FDOQ6515293
Authors: Geoffroy Leconte, D. Orban 
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonsmooth analysis (49J52) 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)
