Adaptive grid semidefinite programming for finding optimal designs
نویسندگان
چکیده
منابع مشابه
Adaptive grid semidefinite programming for finding optimal designs
We find optimal designs for linear models using a novel algorithm that iteratively combines a Semidefinite Programming (SDP) approach with adaptive grid (AG) techniques. The search space is first discretized and SDP is applied to find the optimal design based on the initial grid. The points in the next grid set are points that maximize the dispersion function of the SDP-generated optimal design...
متن کاملA Semidefinite Programming based approach for finding Bayesian optimal designs for nonlinear models
This paper uses Semidefinite Programming (SDP) to construct Bayesian optimal design for nonlinear regression models. The setup here extends the formulation of the optimal designs problem as a SDP problem from linear to nonlinear models. Gaussian Quadrature Formulas (GQF) are used to compute the expectation in the Bayesian design criterion, such as D-, Aor E-optimality. As an illustrative exampl...
متن کاملFinding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming-Based Approach.
This paper uses semidefinite programming (SDP) to construct Bayesian optimal design for nonlinear regression models. The setup here extends the formulation of the optimal designs problem as an SDP problem from linear to nonlinear models. Gaussian quadrature formulas (GQF) are used to compute the expectation in the Bayesian design criterion, such as D-, A- or E-optimality. As an illustrative exa...
متن کاملPenalized and response-adaptive optimal designs. Application to dose finding
Optimal design under a cost constraint is considered, with a scalar coefficient setting the compromise between information (i.e., precision of the estimation of the model parameters) and cost. For suitable cost functions, by increasing the value of the coefficient one can force the support points of an optimal design measure to concentrate around points of minimum cost. When the experiment is c...
متن کاملOptimal bounds for correlations via semidefinite programming
Nonlocal boxes (NLBs) are devices that are used to generate correlated bits between two spatially separated parties. If the generated correlation is weak, it can sometimes be distilled into a stronger correlation by repeated applications of the nonlocal box. We initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2017
ISSN: 0960-3174,1573-1375
DOI: 10.1007/s11222-017-9741-y