论文信息 - Some Algorithmic Aspects of the Theory of Optimal Designs - 字舞流文

Some Algorithmic Aspects of the Theory of Optimal Designs

Changbao Wu | Changbao Wu

[1] H. Wynn,et al. The Convergence of General Step-Length Algorithms for Regular Optimum Design Criteria , 1978 .

[2] J. Tsay,et al. On the Sequential Construction of D-Optimal Designs , 1976 .

[3] J. Kiefer. General Equivalence Theory for Optimum Designs (Approximate Theory) , 1974 .

[4] C. Atwood. Sequences Converging to $D$-Optimal Designs of Experiments , 1973 .

[5] W. J. Studden,et al. Theory Of Optimal Experiments , 1972 .

[6] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .

[7] H. Wynn. The Sequential Generation of $D$-Optimum Experimental Designs , 1970 .

[8] Boris Polyak,et al. Constrained minimization methods , 1966 .

[9] J. Kiefer,et al. Optimum Designs in Regression Problems , 1959 .

[10] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .