Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326)
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 5988288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions |
scientific article; zbMATH DE number 5988288 |
Statements
Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (English)
0 references
14 December 2011
0 references
direct search
0 references
frame-based direct search
0 references
minimal positive basis
0 references
descent conjugate gradient
0 references
data profiles
0 references
performance profiles
0 references
convergence
0 references
algorithms
0 references
0.8825229406356812
0 references
0.7687199115753174
0 references
0.7398619055747986
0 references
0.7377420663833618
0 references