Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
Publication:2841063
DOI10.1093/IMANUM/DRS027zbMath1272.65050OpenAlexW1995126983WikidataQ58040543 ScholiaQ58040543MaRDI QIDQ2841063
Rohollah Garmanjani, Luis Nunes Vicente
Publication date: 24 July 2013
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/drs027
algorithmconvergencenumerical experimentsderivative-free optimizationnonconvexityworst-case complexitydirect searchsmoothing functionnonsmoothness
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)
Related Items (20)
Uses Software
This page was built for publication: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization