Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
type: Item
instance of: scholarly article
title: Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
zbMATH Open document ID: 1297.62175
author: Luc Pronzato
author: A. Zhigljavsky
published in: Journal of Statistical Planning and Inference
publication date: 2014-10-13T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6355019
zbMATH Keywords: approximate design
zbMATH Keywords: optimum design
zbMATH Keywords: construction of optimal designs
zbMATH Keywords: global optimization
MaRDI profile type: Publication
full work available at URL: j.jspi.2014.04.005
OpenAlex ID: W2027349279
cites work: Sequences converging to D-optimal designs of experiments
cites work: Convergent design sequences, for sufficiently regular optimality criteria
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Numerical estimation of a probability measure
cites work: A vertex-exchange-method in D-optimal design theory
cites work: Q4821526
cites work: Q4296156
cites work: A note on the de la Garza phenomenon for locally optimal designs
cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
cites work: Geometry of \(E\)-optimality
cites work: Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
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: Q4360236
cites work: Q3141900
cites work: Optimal Experimental Designs
cites work: Q5534404
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: The Equivalence of Two Extremum Problems
cites work: An approach to nonlinear programming
cites work: On the invariance principle for sums of independent identically distributed random variables
cites work: The Gradient Projection Method under Mild Differentiability Conditions
cites work: Variational Calculus in the Space of Measures and Optimal Design
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q4324980
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
cites work: Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
cites work: Q4849481
cites work: A vertex ranking algorithm for the fixed-charge transportation problem
cites work: Q4871517
cites work: Optimum designs for multi-factor models
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Q4069652
cites work: Q3922026
cites work: An algorithm for optimal designs on a design space
cites work: D-Optimality for Regression Designs: A Review
cites work: Q3657791
cites work: W-Iterations and Ripples Therefrom
cites work: Some algorithmic aspects of the theory of optimal designs
cites work: Some iterative procedures for generating nonsingular optimal designs
cites work: The Sequential Generation of $D$-Optimum Experimental Designs
cites work: On the de la Garza phenomenon
cites work: Support points of locally optimal designs for nonlinear models with two parameters
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.2014.04.005
description: scientific article; zbMATH DE number 6355019