An adaptive discretization algorithm for constrained locally optimal experimental design converges to an optimal design when ε=0 and to an ε-optimal design in finitely many steps when ε>0, with reduced computational effort.
Schittkowski:NLPQLP: A Fortran implementation of a sequential quadratic programming algo- rithm with distributed non-monotone line search.User’s guide, Version 4.2 (2014)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An adaptive discretization algorithm for locally optimal experimental design with constraints
An adaptive discretization algorithm for constrained locally optimal experimental design converges to an optimal design when ε=0 and to an ε-optimal design in finitely many steps when ε>0, with reduced computational effort.