Efficient computational algorithm for optimal continuous experimental designs
From MaRDI portal
Publication:1713154
DOI10.1016/J.CAM.2018.09.046zbMath1409.62156arXiv1804.02655OpenAlexW2963633444WikidataQ129041055 ScholiaQ129041055MaRDI QIDQ1713154
Hon Keung Tony Ng, Wei Gao, Jiangtao Duan
Publication date: 24 January 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.02655
Related Items (2)
Multi-stage differential evolution algorithm for constrained D-optimal design ⋮ Efficient computational algorithms for approximate optimal designs
Cites Work
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Efficient computational algorithm for optimal allocation in regression models
- Computing efficient exact designs of experiments using integer quadratic programming
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- An algorithm for optimal designs on a design space
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- The Sequential Generation of $D$-Optimum Experimental Designs
This page was built for publication: Efficient computational algorithm for optimal continuous experimental designs