A branch-and-bound algorithm for the exact optimal experimental design problem
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for the exact optimal experimental design problem
zbMATH Open document ID: 1475.62015
published in: Statistics and Computing
publication date: 2021-12-10T00:00:00Z
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7442233
zbMATH Keywords: exact optimal experimental design
zbMATH Keywords: Kiefer's optimality criteria
zbMATH Keywords: D-optimality
zbMATH Keywords: A-optimality
author: Selin Damla Ahipaşaoğlu
MaRDI profile type: Publication
full work available at URL: s11222-021-10043-5
OpenAlex ID: W3197226137
cites work: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
cites work: A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
cites work: Q3445852
cites work: Sequences converging to D-optimal designs of experiments
cites work: Faster Subset Selection for Matrices and Applications
cites work: A vertex-exchange-method in D-optimal design theory
cites work: Submodularity and randomized rounding techniques for optimal experimental design
cites work: Marginally Restricted D-Optimal Designs
cites work: Invited Discussion Paper Constrained Optimization of Experimental Design
cites work: A Comparison of Algorithms for Constructing Exact D-Optimal Designs
cites work: Optimal design for nonlinear response models
cites work: Ascent with quadratic assistance for the construction of exact experimental designs
cites work: A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
cites work: Computing efficient exact designs of experiments using integer quadratic programming
cites work: A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
cites work: Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend
cites work: General equivalence theory for optimum designs (approximate theory)
cites work: Minimum-volume enclosing ellipsoids and core sets
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: Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
cites work: Q4849481
cites work: Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
cites work: A geometric approach to optimal design theory
cites work: Q4608039
cites work: Computation of Minimum-Volume Covering Ellipsoids
cites work: On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
cites work: Multiplicative algorithms for computing optimum designs
cites work: Sensor network scheduling for identification of spatially distributed processes
cites work: An Algorithm for Construction of Constrained D-Optimum Designs
cites work: D-optimal design of a monitoring network for parameter estimation of distributed systems
cites work: On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
cites work: Algorithmic complexity: threeNP- hard problems in computational statistics
cites work: Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
cites work: Q5661044
cites work: D-optimal designs via a cocktail algorithm
DOI: 10.1007/S11222-021-10043-5
description: scientific article; zbMATH DE number 7442233