A second-order globally convergent direct-search method and its worst-case complexity (Q2810113)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6587804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A second-order globally convergent direct-search method and its worst-case complexity |
scientific article; zbMATH DE number 6587804 |
Statements
A second-order globally convergent direct-search method and its worst-case complexity (English)
0 references
31 May 2016
0 references
derivative-free optimization
0 references
direct-search
0 references
negative curvature
0 references
worst-case complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8485972285270691
0 references
0.826495349407196
0 references
0.8181194067001343
0 references
0.8121457099914551
0 references
0.7978360652923584
0 references
