Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58040543, #quickstatements; #temporary_batch_1706974288397 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58040543 / rank | |||
Normal rank | |||
Revision as of 17:27, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization |
scientific article |
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
