An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093)
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: An algorithm based on semidefinite programming for finding minimax optimal designs |
scientific article; zbMATH DE number 6920186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm based on semidefinite programming for finding minimax optimal designs |
scientific article; zbMATH DE number 6920186 |
Statements
An algorithm based on semidefinite programming for finding minimax optimal designs (English)
0 references
17 August 2018
0 references
cutting plane algorithm
0 references
design efficiency
0 references
equivalence theorem
0 references
model-based optimal design
0 references
nonlinear programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8879756331443787
0 references
0.8445948958396912
0 references
0.8265956044197083
0 references
0.8260534405708313
0 references
0.8031826615333557
0 references
