On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
From MaRDI portal
Publication:5406368
DOI10.1080/01621459.2013.806268zbMath1283.62161OpenAlexW1989428732MaRDI QIDQ5406368
Elina Tang, Min Yang, Stefanie Biedermann
Publication date: 1 April 2014
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01621459.2013.806268
Related Items (42)
Optimal Design of Experiments for Implicit Models ⋮ Minimax Efficient Random Experimental Design Strategies With Application to Model-Robust Design for Prediction ⋮ The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ Computing minimum-volume enclosing ellipsoids for large datasets ⋮ Removing inessential points in \(c\)-and \(A\)-optimal design ⋮ Optimal designs for comparing curves ⋮ Optimal designs based on the maximum quasi-likelihood estimator ⋮ R-optimal designs for multi-response regression models with multi-factors ⋮ Bayesian \(T\)-optimal discriminating designs ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ Locally D-Optimal Designs for Hierarchical Response Experiments ⋮ Optimal designs for comparing curves in regression models with asymmetric errors ⋮ An efficient algorithm for Elastic I‐optimal design of generalized linear models ⋮ Support point of locally optimal designs for multinomial logistic regression models ⋮ Hybrid exact-approximate design approach for sparse functional data ⋮ LocallyR-optimal designs for a class of nonlinear multiple regression models ⋮ D-optimal designs for multinomial logistic models ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ Optimal designs for some selected nonlinear models ⋮ Combined algorithm to compute D-optimal designs ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ On greedy heuristics for computing D-efficient saturated subsets ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations ⋮ On optimal designs for nonregular models ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ D-optimal design for network A/B testing ⋮ Bayesian \(A\)-optimal design of experiment with quantitative and qualitative responses ⋮ On design and analysis of funnel testing experiments in webpage optimization ⋮ On optimal designs for clinical trials: an updated review ⋮ Optimal experimental design for linear time invariant state-space models ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Optimal Designs for Multi-Response Nonlinear Regression Models With Several Factors via Semidefinite Programming ⋮ On efficient design of pilot experiment for generalized linear models ⋮ On multiple-objective optimal designs ⋮ Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments ⋮ Ascent with quadratic assistance for the construction of exact experimental designs ⋮ T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method ⋮ Saturated locally optimal designs under differentiable optimality criteria ⋮ Optimal designs for semi-parametric dose-response models under random contamination ⋮ Fast algorithms for the minimum volume estimator
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- A note on the de la Garza phenomenon for locally optimal designs
- Identifying locally optimal designs for nonlinear models: A simple extension with profound consequences
- Multiplicative algorithms for computing optimum designs
- Optimal weights for experimental designs on linearly independent support points
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Monotonic convergence of a general algorithm for computing optimal designs
- On the de la Garza phenomenon
- Support points of locally optimal designs for nonlinear models with two parameters
- A vertex-exchange-method in D-optimal design theory
- General equivalence theory for optimum designs (approximate theory)
- Model-oriented design of experiments
- Gustav Elfving's impact on experimental design.
- Optimal designs for estimating the derivative in nonlinear regression
- An algorithm for optimal designs on a design space
- Optimum Experimental Designs for Multinomial Logistic Models
- Optimal Design of Experiments
- Optimal regression designs with previous observations
- The Sequential Generation of $D$-Optimum Experimental Designs
- Locally Optimal Designs for Estimating Parameters
This page was built for publication: On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
