Removing inessential points in c-and A-optimal design

DOI10.1016/J.JSPI.2020.11.011MaRDI QIDQ830728zbMATH OpenOpenAlexFDO

Authors Luc Pronzato, Guillaume Sagnol

Publication date 7 May 2021

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jspi.2020.11.011

zbMATH Keywords

support point\(c\)-optimal design\(A\)-optimal designinessential pointscreening test

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Optimal statistical designs (62K05) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Removal of the points that do not support an \(E\)-optimal experimental design
• Removing non-optimal support points in \(D\)-optimum design algorithms.
• scientific article; zbMATH DE number 2172870
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Computing \(c\)-optimal experimental designs using the simplex method of linear programming

Cites work

• scientific article; zbMATH DE number 3846636 (Why is no real title available?)
• scientific article; zbMATH DE number 3734989 (Why is no real title available?)
• scientific article; zbMATH DE number 3474802 (Why is no real title available?)
• scientific article; zbMATH DE number 800961 (Why is no real title available?)
• A Survey of the S-Lemma
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
• A geometric characterization of \(c\)-optimal designs for heteroscedastic regression
• Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
• An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso
• Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
• Computing \(c\)-optimal experimental designs using the simplex method of linear programming
• Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
• Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
• Elfving's theorem for \(D\)-optimality
• General equivalence theory for optimum designs (approximate theory)
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Monotonic convergence of a general algorithm for computing optimal designs
• On optimal designs for nonlinear models: a general and efficient algorithm
• On the elimination of inessential points in the smallest enclosing ball problem
• On the regularization of singular c-optimal designs
• Optimum Allocation in Linear Regression Theory
• Removal of the points that do not support an \(E\)-optimal experimental design
• Removing non-optimal support points in \(D\)-optimum design algorithms.
• The Equivalence of Two Extremum Problems

Cited in

(4)

• Removing non-optimal support points in \(D\)-optimum design algorithms.
• scientific article; zbMATH DE number 2172870 (Why is no real title available?)
• Removal of the points that do not support an \(E\)-optimal experimental design
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms

This page was built for publication: Removing inessential points in \(c\)-and \(A\)-optimal design

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