Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
From MaRDI portal
Publication:629098
DOI10.1016/J.JSPI.2010.11.031zbMath1207.62156arXiv0912.5467OpenAlexW2962760613MaRDI QIDQ629098
Publication date: 8 March 2011
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.5467
Related Items (30)
Optimal Design of Experiments for Implicit Models ⋮ Exact optimal experimental designs with constraints ⋮ Computing efficient exact designs of experiments using integer quadratic programming ⋮ Removing inessential points in \(c\)-and \(A\)-optimal design ⋮ Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space ⋮ Network-related problems in optimal experimental design and second order cone programming ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ Multiplicative methods for computing \(D\)-optimal stratified designs of experiments ⋮ Optimal design for prediction in multiresponse linear models based on rectangular confidence region ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach ⋮ Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces ⋮ Optimal dose‐finding for efficacy–safety models ⋮ An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ On the semidefinite representation of real functions applied to symmetric matrices ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations ⋮ A class of semidefinite programs with rank-one solutions ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming ⋮ 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 ⋮ Optimal Designs for Multi-Response Nonlinear Regression Models With Several Factors via Semidefinite Programming ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Equivalence of weighted and partial optimality of experimental designs ⋮ Design of c-optimal experiments for high-dimensional linear models ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of semidefinite programs with rank-one solutions
- Elfving's theorem for \(D\)-optimality
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- 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
- A geometric characterization of \(c\)-optimal designs for heteroscedastic regression
- Applications of second-order cone programming
- On linear regression designs which maximize information
- General equivalence theory for optimum designs (approximate theory)
- Removing non-optimal support points in \(D\)-optimum design algorithms.
- Gustav Elfving's impact on experimental design.
- Elfving's theorem revisited
- Minimax designs in linear regression models
- Geometry of \(E\)-optimality
- One hundred years of the design of experiments on and off the pages of Biometrika
- Submodularity and Randomized rounding techniques for Optimal Experimental Design
- Experimental design in a class of models
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Determinant Maximization with Linear Matrix Inequality Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Elfving's Theorem and Optimal Designs for Quadratic Loss
- Randomized Algorithms for Semi-Infinite Programming Problems
- The Sequential Generation of $D$-Optimum Experimental Designs
- Optimum Allocation in Linear Regression Theory
This page was built for publication: Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
