Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices

DOI10.2478/s12175-009-0157-9zbMath1211.62128OpenAlexW2013317493MaRDI QIDQ3648372

Mária Trnovská, Radoslav Harman

Publication date: 25 November 2009

Published in: Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s12175-009-0157-9

zbMATH Keywords

multivariate regression\(D\)-optimal designsmultiplicative algorithm

Mathematics Subject Classification ID

Related Items (17)

Removing inessential points in \(c\)-and \(A\)-optimal design ⋮ Efficient Algorithms for Optimal Designs with Correlated Observations in Pharmacokinetics and Dose-Finding Studies ⋮ A Newton Frank-Wolfe method for constrained self-concordant minimization ⋮ Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space ⋮ A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization ⋮ Multiplicative methods for computing \(D\)-optimal stratified designs of experiments ⋮ Computing maximin efficient experimental designs using the methods of semidefinite programming ⋮ Locally optimal designs for multivariate generalized linear models ⋮ A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Removal of the points that do not support an \(E\)-optimal experimental design ⋮ Analytic solutions for locally optimal designs for gamma models having linear predictors without intercept ⋮ Monotonic convergence of a general algorithm for computing optimal designs ⋮ An Algorithm for Construction of Constrained D-Optimum Designs ⋮ Locally optimal designs for gamma models ⋮ Ascent with quadratic assistance for the construction of exact experimental designs ⋮ K-Optimal Design via Semidefinite Programming and Entropy Optimization

Cites Work

• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• The Equivalence of Two Extremum Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices