CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727)
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 2183996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm |
scientific article; zbMATH DE number 2183996 |
Statements
CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (English)
0 references
30 June 2005
0 references
high-computing-load
0 references
Noisy optimization
0 references
Lagrange interpolation
0 references
Trust region method
0 references
Optimal shape design
0 references
Parallel computing
0 references
UOBYQA algorithm
0 references
unconstrained optimization by Quadratical Approximation
0 references
numerical results
0 references
0 references
0.7820556163787842
0 references
0.7820556163787842
0 references
0.7460514903068542
0 references
0.7411039471626282
0 references
