A discussion on variational analysis in derivative-free optimization (Q829491)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A discussion on variational analysis in derivative-free optimization |
scientific article; zbMATH DE number 7344789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A discussion on variational analysis in derivative-free optimization |
scientific article; zbMATH DE number 7344789 |
Statements
A discussion on variational analysis in derivative-free optimization (English)
0 references
6 May 2021
0 references
Derivative-Free Optimization (DFO) is the mathematical study of algorithms for continuous optimization that do not use first-order information. Thus, by definition, DFO studies algorithms that do not use derivatives, gradients, directional derivatives, subgradients, normal cones, tangent cones, etc. As such, it might seem that Variational Analysis would have limited value in DFO research. However, a study of DFO shows that this is a false conclusion. In fact, the many of the most successful DFO algorithms rely heavily on tools and results from Variational Analysis. In this paper, the author highlights some of this research and argue that Variational Analysis is a critical component to studying DFO.
0 references
derivative-free optimization
0 references
variational analysis
0 references
direct-search method
0 references
model-based methods
0 references
order-\(N\) accuracy
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references