On greedy heuristics for computing D-efficient saturated subsets

DOI10.1016/J.ORL.2020.01.003MaRDI QIDQ1984679zbMATH OpenOpenAlexFDO

Authors Radoslav Harman, Samuel Rosa

Publication date 7 April 2020

Published in Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

D-optimalityoptimal experimental designsubsamplinggreedy heuristicminimum-volume enclosing ellipsoid

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Heuristic optimization of experimental designs.
• A computational algebraic approach for saturated \(D\)-optimal designs with \(n\equiv 2\pmod 4\) observations
• An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs
• scientific article; zbMATH DE number 1123801
• Intractability and analysis of heuristics for discrete optimization. II

Cites work

• scientific article; zbMATH DE number 3945143 (Why is no real title available?)
• scientific article; zbMATH DE number 1077338 (Why is no real title available?)
• scientific article; zbMATH DE number 800961 (Why is no real title available?)
• scientific article; zbMATH DE number 5224144 (Why is no real title available?)
• scientific article; zbMATH DE number 3052220 (Why is no real title available?)
• A Ridge-Type Procedure for Design of Experiments
• A geometric approach to optimal design theory
• A statistical perspective on algorithmic leveraging
• Algorithmic searches for optimal designs
• An analysis of approximations for maximizing submodular set functions—I
• Approximating the volume of convex bodies
• Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
• D-optimal designs via a cocktail algorithm
• Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Fast algorithms for the minimum volume estimator
• Information-Based Optimal Subdata Selection for Big Data Linear Regression
• Minimum-volume ellipsoids. Theory and algorithms
• Minimum-volume enclosing ellipsoids and core sets
• On optimal designs for nonlinear models: a general and efficient algorithm
• On the singularity probability of random Bernoulli matrices
• Optimal design with bounded density: Optimization algorithms of the exchange type
• Optimal design: Some geometrical aspects of D-optimality
• Optimal supersaturated designs
• Optimum experimental designs, with SAS
• Principles of experimental design for big data analysis
• Replicationfree optimal design in regression analysis
• Screening
• Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs

Cited in

(8)

• Computing minimum-volume enclosing ellipsoids for large datasets
• ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors
• On the greedy algorithm for satisfiability
• Optimal design of multifactor experiments via grid exploration
• On greedy heuristics for computing D-efficient saturated subsets
• A review on design inspired subsampling for big data
• On parallelizing a greedy heuristic for finding small dominant sets
• Circuits for robust designs

This page was built for publication: On greedy heuristics for computing D-efficient saturated subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1984679)