Adaptive grid semidefinite programming for finding optimal designs
type: Item
instance of: scholarly article
title: Adaptive grid semidefinite programming for finding optimal designs
zbMATH Open document ID: 1505.62131
author: Weng Kee Wong
author: Belmiro P. M. Duarte
author: Holger Dette
published in: Statistics and Computing
publication date: 2018-02-27T00:00:00Z
full work available at URL: 0p9068t9
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6844376
zbMATH Keywords: adaptive grid
zbMATH Keywords: continuous design
zbMATH Keywords: model-based optimal design
zbMATH Keywords: nonlinear programming
zbMATH Keywords: semidefinite programming
describes a project that uses: ADiMat
describes a project that uses: Ipopt
describes a project that uses: SNOPT
describes a project that uses: SeDuMi
describes a project that uses: CONOPT
describes a project that uses: CVX
describes a project that uses: Mosek
MaRDI profile type: Publication
OpenAlex ID: W2511582908
cites work: Q4863586
cites work: The construction of exact D-optimum experimental designs with application to blocking response surface designs
cites work: Q3445852
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: A semidefinite programming study of the Elfving theorem
cites work: An Introduction to Optimal Designs for Social and Biomedical Research
cites work: Adaptive remeshing for compressible flow computations
cites work: Q4821526
cites work: An Interior Point Algorithm for Large-Scale Nonlinear Programming
cites work: Optimal Bayesian design applied to logistic regression experiments
cites work: Minimax optimal designs via particle swarm optimization methods
cites work: On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
cites work: A Comparison of Algorithms for Constructing Exact D-Optimal Designs
cites work: \(E\)-optimal designs for second-order response surface models
cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
cites work: Geometry of \(E\)-optimality
cites work: CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
cites work: CONOPT—A Large-Scale GRG Code
cites work: A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
cites work: Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
cites work: A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
cites work: Optimal design for nonlinear response models
cites work: Computing maximin efficient experimental designs using the methods of semidefinite programming
cites work: Linearization methods for optimization of functionals which depend on probability measures
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: Computing \(c\)-optimal experimental designs using the simplex method of linear programming
cites work: Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
cites work: Q3844024
cites work: General equivalence theory for optimum designs (approximate theory)
cites work: The Equivalence of Two Extremum Problems
cites work: Optimal designs for discriminating between some extensions of the Michaelis-Menten model
cites work: Construction of optimal designs using a clustering approach
cites work: Algorithmic searches for optimal designs
cites work: Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
cites work: Functional approach to optimal experimental design.
cites work: The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
cites work: An Algorithm for the Construction of "D-Optimal" Experimental Designs
cites work: Q5661044
cites work: Optimal Designs for Rational Function Regression
cites work: Q3716108
cites work: Removing non-optimal support points in \(D\)-optimum design algorithms.
cites work: Optimal experimental design and some related control problems
cites work: Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
cites work: Q4849481
cites work: Optimal weights for experimental designs on linearly independent support points
cites work: Q3376534
cites work: Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
cites work: On the semidefinite representation of real functions applied to symmetric matrices
cites work: Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
cites work: Q3922026
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Two classes of multiplicative algorithms for constructing optimizing distributions

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Multiplicative algorithms for computing optimum designs

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Semidefinite Programming

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Applications of semidefinite programming

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Algorithmic complexity: threeNP- hard problems in computational statistics

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Q4768502

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Robust designs for binary data: applications of simulated annealing

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Some algorithmic aspects of the theory of optimal designs

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: The covergence of general step-length algorithms for regular optimum design criteria

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: The Sequential Generation of $D$-Optimum Experimental Designs

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: D-optimal designs via a cocktail algorithm

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Monotonic convergence of a general algorithm for computing optimal designs

Adaptive grid semidefinite programming for finding optimal designs (cites work)
cites work: Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs

Adaptive grid semidefinite programming for finding optimal designs (DOI)
DOI: 10.1007/S11222-017-9741-Y