Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
type: Item
instance of: scholarly article
title: Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
zbMATH Open document ID: 1279.62152
author: Radoslav Harman
published in: Journal of Statistical Planning and Inference
publication date: 2014-01-23T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 62J05
Mathematics Subject Classification ID: 65C60
zbMATH DE Number: 6249524
zbMATH Keywords: \(D\)-optimal designs
zbMATH Keywords: stratified designs
zbMATH Keywords: marginal constraints
zbMATH Keywords: multiplicative algorithm
zbMATH Keywords: barycentric algorithm
describes a project that uses: R
MaRDI profile type: Publication
full work available at URL: j.jspi.2013.10.003
OpenAlex ID: W2090951881
cites work: Q3445852
cites work: Convex analysis and nonlinear optimization. Theory and examples
cites work: Invited Discussion Paper Constrained Optimization of Experimental Design
cites work: Marginally Restricted D-Optimal Designs
cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
cites work: Model-oriented design of experiments
cites work: Q4869639
cites work: Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
cites work: Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
cites work: Marginally restricted linear-optimal designs
cites work: General equivalence theory for optimum designs (approximate theory)
cites work: Optimum Designs in Regression Problems
cites work: The Equivalence of Two Extremum Problems
cites work: Q4651046
cites work: Marginally restricted sequential D‐optimal designs
cites work: Constructing optimal designs with constraints
cites work: Construction of marginally and conditionally restricted designs using multiplicative algorithms
cites work: Q3716108
cites work: Lectures on Choquet's theorem
cites work: A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
cites work: Optimal Design of Experiments
cites work: Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
cites work: An algorithm for optimal designs on a design space
cites work: Two classes of multiplicative algorithms for constructing optimizing distributions
cites work: Multiplicative algorithms for computing optimum designs
cites work: D-optimal design of a monitoring network for parameter estimation of distributed systems
cites work: Determinant Maximization with Linear Matrix Inequality Constraints
cites work: Barycentric coordinates for convex sets
cites work: Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
cites work: Some algorithmic aspects of the theory of optimal designs
cites work: Monotonic convergence of a general algorithm for computing optimal designs
cites work: Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
cites work: D-optimal designs via a cocktail algorithm
DOI: 10.1016/J.JSPI.2013.10.003
description: scientific article; zbMATH DE number 6249524