Computing exact \(D\)-optimal designs by mixed integer second-order cone programming

From MaRDI portal
Revision as of 15:58, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:888509

DOI10.1214/15-AOS1339zbMath1331.62384arXiv1307.4953MaRDI QIDQ888509

Radoslav Harman, Guillaume Sagnol

Publication date: 30 October 2015

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.4953




Related Items (27)

A prediction-oriented optimal design for visualisation recommender systemsOptimal Design of Experiments for Implicit ModelsComputing optimal experimental designs with respect to a compound Bayes risk criterionQuasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix spaceAn algorithm based on semidefinite programming for finding minimax optimal designsOptimal designs for dose-response models with linear effects of covariatesComputing exact \(D\)-optimal designs by mixed integer second-order cone programmingGeneration of point sets by convex optimization for interpolation in reproducing kernel Hilbert spacesAn unexpected connection between Bayes \(A\)-optimal designs and the group LassoAdaptive grid semidefinite programming for finding optimal designsApproximate optimal designs for multivariate polynomial regressionScalable Algorithms for the Sparse Ridge RegressionA Randomized Exchange Algorithm for Computing Optimal Approximate Designs of ExperimentsBarycentric algorithm for computing D-optimal size- and cost-constrained designs of experimentsConstruction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterionApproximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programmingOn optimal designs for nonregular modelsOptimal exact designs of experiments via mixed integer nonlinear programmingApproximation Algorithms for D-optimal DesignOptimal experimental design for linear time invariant state-space modelsA branch-and-bound algorithm for the exact optimal experimental design problemOptimal design of multifactor experiments via grid explorationEquivalence of weighted and partial optimality of experimental designsOn multiple-objective optimal designsGeneration of collocation points in the method of fundamental solutions for 2D Laplace's equationAscent with quadratic assistance for the construction of exact experimental designsPrivacy sets for constrained space-filling


Uses Software



Cites Work




This page was built for publication: Computing exact \(D\)-optimal designs by mixed integer second-order cone programming