Computing \(E\)-optimal polynomial regression designs.
From MaRDI portal
Publication:1817298
DOI10.1016/0378-3758(95)00190-5zbMath1076.62539OpenAlexW2050419387MaRDI QIDQ1817298
Publication date: 1996
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(95)00190-5
Chebyshev systemChebyshev approximationE-optimal designsWeighted polynomial regressionApproximate designsEquioscillating polynomialRemez's algorithm
Related Items (6)
\(E\)-optimal designs for polynomial regression without intercept ⋮ V-optimal designs for heteroscedastic regression ⋮ E-optimal designs for polynomial spline regression ⋮ Unnamed Item ⋮ \(E\)-optimal designs for rational models ⋮ Locally asymptotically optimal designs for testing in logistic regression.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on \(E\)-optimal designs for weighted polynomial regression
- Optimal weights for experimental designs on linearly independent support points
- Further characterizations of design optimality and admissibility for partial parameter estimation in linear regression
- Remez's procedure for finding optimal designs
- Totally nonnegative moment matrices
- \(E\)-optimal designs in weighted polynomial regression
- A matrix optimization problem
- \(E\)-optimal designs for polynomial regression
- Equioscillation under nonuniqueness in the approximation of continuous functions
- On c-optimal design measures
- On a class of algorithms from experimental design theory
- Optimal Experimental Designs
- Optimal Designs on Tchebycheff Points
This page was built for publication: Computing \(E\)-optimal polynomial regression designs.