Admissible Designs for Polynomial Monospline Regression
نویسندگان
چکیده
منابع مشابه
Approximate Optimal Designs for Multivariate Polynomial Regression
Abstract: We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semi-algebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically the approximate optimal design problem. The geometry of the design is recovered via semidefinite programming duality theory. Th...
متن کاملRobust Designs for Approximately Polynomial Regression Abbreviated title: Robust Polynomial Designs
Abstract We study designs for the regression model E[Y jx] = Pp 1 j=0 jx+x (x), where (x) is unknown but bounded in absolute value by a given function (x). This class of response functions models departures from an exact polynomial response. We consider the construction of designs which are robust, with respect to various criteria, as the true response varies over this class. The resulting desi...
متن کاملConstrained D-and D 1 -optimal Designs for Polynomial Regression
In the common polynomial regression model of degree m we consider the problem of determining the D-and D 1-optimal designs subject to certain constraints for the D 1-eeciencies in the models of degree m ? j; m ? j + 1; : : : ; m + k (m > j 0; k 0 given). We present a complete solution of these problems, which on the one hand allow a fast computation of the constrained optimal designs and on the...
متن کاملNonparametric Regression Estimation under Kernel Polynomial Model for Unstructured Data
The nonparametric estimation(NE) of kernel polynomial regression (KPR) model is a powerful tool to visually depict the effect of covariates on response variable, when there exist unstructured and heterogeneous data. In this paper we introduce KPR model that is the mixture of nonparametric regression models with bootstrap algorithm, which is considered in a heterogeneous and unstructured framewo...
متن کاملAdmissible closures of polynomial time computable arithmetic
We propose two admissible closures A(PTCA) and A(PHCA) of Ferreira’s system PTCA of polynomial time computable arithmetic and of full bounded arithmetic (or polynomial hierarchy computable arithmetic) PHCA. The main results obtained are: (i) A(PTCA) is conservative over PTCA with respect to ∀∃Σ1 sentences, and (ii) A(PHCA) is conservative over full bounded arithmetic PHCA for ∀∃Σ∞ sentences. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1980
ISSN: 0090-5364
DOI: 10.1214/aos/1176345083