Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
Work
Year: 2012
Type: article
Abstract: In the context of the derivative-free optimization of a smooth objective function, it has been shown that the worst-case complexity of direct-search methods is of the same order as that of the steepes... more
Authors R. Garmanjani, L. N. Vicente
Institution University of Coimbra
Cites: 37
Cited by: 47
Related to: 10
FWCI: 7.985
Citation percentile (by year/subfield): 88.47
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: green