Adaptive grid semidefinite programming for finding optimal designs
From MaRDI portal
Recommendations
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Computing A-optimal and E-optimal designs for regression models via semidefinite programming
- On optimal designs for nonlinear models: a general and efficient algorithm
- Using SeDuMi to find various optimal designs for regression models
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
Cites work
- scientific article; zbMATH DE number 3945143 (Why is no real title available?)
- scientific article; zbMATH DE number 3176492 (Why is no real title available?)
- scientific article; zbMATH DE number 3734989 (Why is no real title available?)
- scientific article; zbMATH DE number 3443036 (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?)
- scientific article; zbMATH DE number 837298 (Why is no real title available?)
- scientific article; zbMATH DE number 3393615 (Why is no real title available?)
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- A semidefinite programming study of the Elfving theorem
- Adaptive remeshing for compressible flow computations
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- Algorithmic searches for optimal designs
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An Introduction to Optimal Designs for Social and Biomedical Research
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
- Applications of semidefinite programming
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- CONOPT—A Large-Scale GRG Code
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Computing maximin efficient experimental designs using the methods of semidefinite programming
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Construction of optimal designs using a clustering approach
- D-optimal designs via a cocktail algorithm
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
- Functional approach to optimal experimental design.
- General equivalence theory for optimum designs (approximate theory)
- Geometry of \(E\)-optimality
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linearization methods for optimization of functionals which depend on probability measures
- Minimax optimal designs via particle swarm optimization methods
- Monotonic convergence of a general algorithm for computing optimal designs
- Multiplicative algorithms for computing optimum designs
- Nonlinear optimization.
- On optimal designs for nonlinear models: a general and efficient algorithm
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the semidefinite representation of real functions applied to symmetric matrices
- Optimal Bayesian design applied to logistic regression experiments
- Optimal design for nonlinear response models
- Optimal designs for discriminating between some extensions of the Michaelis-Menten model
- Optimal designs for rational function regression
- Optimal experimental design and some related control problems
- Optimal weights for experimental designs on linearly independent support points
- Optimum experimental designs, with SAS
- Removing non-optimal support points in \(D\)-optimum design algorithms.
- Robust designs for binary data: applications of simulated annealing
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semidefinite Programming
- Some algorithmic aspects of the theory of optimal designs
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- The Equivalence of Two Extremum Problems
- The Sequential Generation of D-Optimum Experimental Designs
- The construction of exact D-optimum experimental designs with application to blocking response surface designs
- The covergence of general step-length algorithms for regular optimum design criteria
- Two classes of multiplicative algorithms for constructing optimizing distributions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- \(E\)-optimal designs for second-order response surface models
Cited in
(11)- Optimal experimental design: from design point to design region
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- Using SeDuMi to find various optimal designs for regression models
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Risk-adapted optimal experimental design
- ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors
- Optimal experimental design for linear time invariant state-space models
- Optimal design of multifactor experiments via grid exploration
- Model robust designs for dose-response models
- Optimal exact designs of experiments via mixed integer nonlinear programming
- An exchange algorithm for optimal calibration of items in computerized achievement tests
This page was built for publication: Adaptive grid semidefinite programming for finding optimal designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702022)
