Adaptive grid semidefinite programming for finding optimal designs
From MaRDI portal
Publication:1702022
DOI10.1007/s11222-017-9741-yzbMath1505.62131OpenAlexW2511582908MaRDI QIDQ1702022
Weng Kee Wong, Dette, Holger, Belmiro P. M. Duarte
Publication date: 27 February 2018
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/0p9068t9
semidefinite programmingnonlinear programmingcontinuous designadaptive gridmodel-based optimal design
Computational methods for problems pertaining to statistics (62-08) Optimal statistical designs (62K05) Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47)
Related Items (6)
Risk-Adapted Optimal Experimental Design ⋮ An exchange algorithm for optimal calibration of items in computerized achievement tests ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ Optimal experimental design for linear time invariant state-space models ⋮ Optimal design of multifactor experiments via grid exploration ⋮ T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Minimax optimal designs via particle swarm optimization methods
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- \(E\)-optimal designs for second-order response surface models
- A semidefinite programming study of the Elfving theorem
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Multiplicative algorithms for computing optimum designs
- Optimal weights for experimental designs on linearly independent support points
- Functional approach to optimal experimental design.
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Optimal designs for discriminating between some extensions of the Michaelis-Menten model
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Monotonic convergence of a general algorithm for computing optimal designs
- Two classes of multiplicative algorithms for constructing optimizing distributions
- Adaptive remeshing for compressible flow computations
- Optimal Bayesian design applied to logistic regression experiments
- General equivalence theory for optimum designs (approximate theory)
- Some algorithmic aspects of the theory of optimal designs
- The covergence of general step-length algorithms for regular optimum design criteria
- Applications of semidefinite programming
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Removing non-optimal support points in \(D\)-optimum design algorithms.
- Computing maximin efficient experimental designs using the methods of semidefinite programming
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- Geometry of \(E\)-optimality
- On the semidefinite representation of real functions applied to symmetric matrices
- Optimal experimental design and some related control problems
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Construction of optimal designs using a clustering approach
- Lectures on Modern Convex Optimization
- Optimal Design for Nonlinear Response Models
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- The Equivalence of Two Extremum Problems
- An Introduction to Optimal Designs for Social and Biomedical Research
- Linearization methods for optimization of functionals which depend on probability measures
- The construction of exact D-optimum experimental designs with application to blocking response surface designs
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Algorithmic complexity: threeNP- hard problems in computational statistics
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- CONOPT—A Large-Scale GRG Code
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Semidefinite Programming
- Optimal Designs for Rational Function Regression
- Robust designs for binary data: applications of simulated annealing
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
- The Sequential Generation of $D$-Optimum Experimental Designs
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
This page was built for publication: Adaptive grid semidefinite programming for finding optimal designs
