Exchange algorithms for constructing large spatial designs
From MaRDI portal
Publication:5957818
DOI10.1016/S0378-3758(01)00127-6zbMath0985.62059OpenAlexW2138366349WikidataQ57878212 ScholiaQ57878212MaRDI QIDQ5957818
Publication date: 23 May 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(01)00127-6
Related Items (8)
Unnamed Item ⋮ Optimal predictive design augmentation for spatial generalised linear mixed models ⋮ Orthogonal subsampling for big data linear regression ⋮ Evolutionary Markov chain Monte Carlo algorithms for optimal monitoring network designs ⋮ Information gathering in Bayesian networks applied to petroleum prospecting ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ Issues in the optimal design of computer simulation experiments ⋮ Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Case studies in environmental statistics
- A new approach to the construction of optimal designs
- Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Computer Augmentation of Experimental Designs to Maximize |X′X|
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Computer Aided Design of Experiments
- Factorial Designs, the |X′X| Criterion, and Some Related Matters
This page was built for publication: Exchange algorithms for constructing large spatial designs
