Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- 1 January 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 32 (1), 232-259
- https://doi.org/10.1137/0132021
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A central cutting plane algorithm for the convex programming problemMathematical Programming, 1975
- Optimal input signals for parameter estimation in dynamic systems--Survey and new resultsIEEE Transactions on Automatic Control, 1974
- General Equivalence Theory for Optimum Designs (Approximate Theory)The Annals of Statistics, 1974
- Numerical treatment of a class of semi‐infinite programming problemsNaval Research Logistics Quarterly, 1973
- Choice of Response Functional Form in Designing Subsidy ExperimentsEconometrica, 1973
- A geometric approach to optimal design theoryBiometrika, 1973
- Sequences Converging to $D$-Optimal Designs of ExperimentsThe Annals of Statistics, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACESProceedings of the National Academy of Sciences, 1962
- The Equivalence of Two Extremum ProblemsCanadian Journal of Mathematics, 1960