Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063)
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: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization |
scientific article; zbMATH DE number 6190572
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization |
scientific article; zbMATH DE number 6190572 |
Statements
Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (English)
0 references
24 July 2013
0 references
derivative-free optimization
0 references
direct search
0 references
smoothing function
0 references
worst-case complexity
0 references
nonsmoothness
0 references
nonconvexity
0 references
algorithm
0 references
convergence
0 references
numerical experiments
0 references
0.9221853
0 references
0.91707003
0 references
0.9156601
0 references
0.9087534
0 references
0.8982085
0 references
0.89749825
0 references
0.89729774
0 references
0.8963491
0 references
