Optimal minimax designs over a prespecified interval in a heteroscedastic polynomial model
type: Item
instance of: scholarly article
title: Optimal minimax designs over a prespecified interval in a heteroscedastic polynomial model
zbMATH Open document ID: 1147.62356
author: Ray-Bing Chen
author: Weng Kee Wong
author: Kun-Yu Li
published in: Statistics \& Probability Letters
publication date: 2008-09-29T00:00:00Z
full work available at URL: pmc2638066
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 62K20
Mathematics Subject Classification ID: 62C20
zbMATH DE Number: 5348304
zbMATH Keywords: equivalence theorems
Wikidata QID: Q37088964
MaRDI profile type: Publication
OpenAlex ID: W1970404000
cites work: Q4004421
cites work: An algorithmic construction of optimal minimax designs for heteroscedastic linear models
cites work: Convex optimal designs for compound polynomial extrapolation
cites work: Q4203561
cites work: Design for Optimal Prediction in Simple Linear Regression
cites work: Optimal Spacing and Weighting in Polynomial Prediction
cites work: Model robust extrapolation designs
cites work: Optimum extrapolation and interpolation designs. I, II
cites work: On a Theorem of Hoel and Levine on Extrapolation Designs
cites work: Optimal minimax designs for prediction in heteroscedastic models
cites work: A Problem in Minimax Variance Polynomial Extrapolation
cites work: A unified approach to the construction of minimax designs
cites work: \(G\)-optimal designs for multi-factor experiments with heteroscedastic errors
DOI: 10.1016/J.SPL.2008.01.059
description: scientific article; zbMATH DE number 5348304