Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
From MaRDI portal
Publication:4127816
DOI10.1137/0132021zbMath0356.62060OpenAlexW2020173525MaRDI QIDQ4127816
Paul R. Gribik, Kenneth O. Kortanek
Publication date: 1977
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0132021
Related Items (14)
Optimal design of experiments via linear programming ⋮ A review of reliable maximum likelihood algorithms for semiparametric mixture models ⋮ On linear regression designs which maximize information ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Combined algorithm to compute D-optimal designs ⋮ A constrained optimum experimental design problem for model discrimination with a continuously varying factor ⋮ A multiperiod planning model for communications satellites ⋮ A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination ⋮ Separably-infinite programs ⋮ An introduction to designh optimality with an overview of the literature ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Some exact iterative procedures for finding the puncture point of a convex set ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
This page was built for publication: Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
