Compound optimal design of experiments - semidefinite programming formulations
From MaRDI portal
Cites work
- A Metaheuristic Adaptive Cubature Based Algorithm to Find Bayesian Optimal Designs for Nonlinear Models
- A radial basis function method for global optimization
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- A stochastic radial basis function method for the global optimization of expensive functions
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Applications of semidefinite programming
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- D-optimal designs via a cocktail algorithm
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Disciplined quasiconvex programming
- DT-optimum designs for model discrimination and parameter estimation
- Experimental design in a class of models
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
- General equivalence theory for optimum designs (approximate theory)
- GOSAC: global optimization with surrogate approximation of constraints
- scientific article; zbMATH DE number 5522287 (Why is no real title available?)
- scientific article; zbMATH DE number 124386 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Locally Optimal Designs for Estimating Parameters
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Minimizing the condition number to construct design points for polynomial regression models
- MISO: mixed-integer surrogate optimization framework
- Nonlinear multiobjective optimization
- On multiple-objective optimal designs
- On Nonlinear Fractional Programming
- On optimal designs for nonlinear models: a general and efficient algorithm
- On the Equivalence of Constrained and Compound Optimal Designs
- On the semidefinite representation of real functions applied to symmetric matrices
- Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests
- Optimum experimental designs, with SAS
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Semidefinite Programming
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints
- The Equivalence of Constrained and Weighted Designs in Multiple Objective Design Problems
- Using CVX to Construct Optimal Designs for Biomedical Studies with Multiple Objectives
This page was built for publication: Compound optimal design of experiments - semidefinite programming formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268279)