An algorithm based on semidefinite programming for finding minimax optimal designs
From MaRDI portal
Publication:1662093
DOI10.1016/j.csda.2017.09.008zbMath1469.62058OpenAlexW2766497038MaRDI QIDQ1662093
Weng Kee Wong, Guillaume Sagnol, Belmiro P. M. Duarte
Publication date: 17 August 2018
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/2c30q4rr
nonlinear programmingequivalence theoremdesign efficiencycutting plane algorithmmodel-based optimal design
Computational methods for problems pertaining to statistics (62-08) Optimal statistical designs (62K05) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)
Related Items (4)
Optimal designs for comparing curves in regression models with asymmetric errors ⋮ A new monotonic algorithm for the \(E\)-optimal experiment design problem ⋮ A web-based tool for designing experimental studies to detect hormesis and estimate the threshold dose ⋮ Optimal Designs for Multi-Response Nonlinear Regression Models With Several Factors via Semidefinite Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Optimum design accounting for the global nonlinear behavior of the model
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Recent trends indicate rapid growth of nature-inspired optimization in academia and industry
- Survival of the flexible: explaining the recent popularity of nature-inspired optimization within a rapidly evolving world
- Identification of parametric models from experimental data. Transl. from an upd. French version by the authors, with the help of John Norton
- Functional approach to optimal experimental design.
- Semi-infinite programming
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Robust experiment design via maximin optimization
- Optimal Bayesian design applied to logistic regression experiments
- General equivalence theory for optimum designs (approximate theory)
- Infinitely constrained optimization problems
- Applications of semidefinite programming
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Semi-infinite programming and applications to minimax problems
- A minimax algorithm for constructing optimal symmetrical balanced designs for a logistic regression model
- Analysis of logistic growth models
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Convergence of an interior point algorithm for continuous minimax
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- Optimal design of experiments via linear programming
- On the semidefinite representation of real functions applied to symmetric matrices
- Optimal experimental design and some related control problems
- Dose finding in drug development.
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Lectures on Modern Convex Optimization
- An Algorithm for Construction of Constrained D-Optimum Designs
- Optimal Design for Nonlinear Response Models
- Semi-Infinite Programming: Theory, Methods, and Applications
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- An Introduction to Optimal Designs for Social and Biomedical Research
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Linearization methods for optimization of functionals which depend on probability measures
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Convex design theory1
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Model Robust, Linear-Optimal Designs
- A unified approach to the construction of minimax 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
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Semidefinite Programming
- Optimal Designs for Rational Function Regression
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Linear Statistical Inference and its Applications
- Global optimization problems in optimal design of experiments in regression models
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
This page was built for publication: An algorithm based on semidefinite programming for finding minimax optimal designs
