Exact optimal experimental designs with constraints
From MaRDI portal
Publication:2361462
DOI10.1007/s11222-016-9658-xzbMath1505.62137OpenAlexW2395641940MaRDI QIDQ2361462
Agata Leszkiewicz, Mercedes Esteban-Bravo, Jose M. Vidal-Sanz
Publication date: 30 June 2017
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-016-9658-x
Computational methods for problems pertaining to statistics (62-08) Optimal statistical designs (62K05) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (3)
I-robust and D-robust designs on a finite design space ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Minimax optimal designs via particle swarm optimization methods
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Jack Kiefer's contributions to experimental design
- Convergent design sequences, for sufficiently regular optimality criteria
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- Computing efficient exact designs of experiments using integer quadratic programming
- Local convergence of a primal-dual method for degenerate nonlinear programming
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Exploiting structure in parallel implementation of interior point methods for optimization
- Sequences converging to D-optimal designs of experiments
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
- Optimum Designs in Regression Problems
- The Equivalence of Two Extremum Problems
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- D-Optimality for Regression Designs: A Review
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Elfving's Theorem and Optimal Designs for Quadratic Loss
- Robust designs for binary data: applications of simulated annealing
- Optimal Experimental Designs
- The Sequential Generation of $D$-Optimum Experimental Designs
- Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
- Nonlinear programming without a penalty function.
This page was built for publication: Exact optimal experimental designs with constraints
