Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
type: Item
instance of: scholarly article
title: Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
zbMATH Open document ID: 1394.62102
published in: Journal of Statistical Planning and Inference
publication date: 2018-06-21T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 65C60
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6892813
zbMATH Keywords: information matrix
zbMATH Keywords: optimality criterion
zbMATH Keywords: local optimal design
zbMATH Keywords: convex hull
zbMATH Keywords: efficiency
zbMATH Keywords: gradient
zbMATH Keywords: local quadratic approximation
zbMATH Keywords: convex quadratic minimization
zbMATH Keywords: BFGS update
zbMATH Keywords: multiplicative algorithm
author: Norbert Gaffke
author: Rainer Schwabe
MaRDI profile type: Publication
full work available at URL: j.jspi.2018.03.005
OpenAlex ID: W2810368869
cites work: The design of experiments for discriminating between two rival models
cites work: Elemental information matrices and optimal experimental design for generalized regression models
cites work: Convergent design sequences, for sufficiently regular optimality criteria
cites work: Numerical estimation of a probability measure
cites work: Numerical techniques for estimating probabilities
cites work: A remark on the numerical estimation of probabilities
cites work: \(T\)-optimal designs for discrimination between two polynomial models
cites work: \(T\)-optimal discriminating designs for Fourier regression models
cites work: Optimal discrimination designs
cites work: Q4517112
cites work: Q4226179
cites work: Computing optimal approximate invariant designs for cubic regression on multidimensional balls and cubes
cites work: Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity
cites work: Second order methods for solving extremum problems form optimal linar regression design
cites work: Q3958598
cites work: On a class of algorithms from experimental design theory
cites work: Geometric algorithms and combinatorial optimization.
cites work: Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
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: Minimizing pseudoconvex functions on convex compact sets
cites work: Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
cites work: Topics in optimal design
cites work: Computing Optimal Experimental Designs via Interior Point Method
cites work: Removing non-optimal support points in \(D\)-optimum design algorithms.
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: Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
cites work: Optimal Design of Experiments
cites work: Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
cites work: Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
cites work: The optimality of single-group designs for certain mixed models
cites work: An algorithm for optimal designs on a design space
cites work: Some algorithmic aspects of the theory of optimal designs
cites work: The Sequential Generation of $D$-Optimum Experimental Designs
cites work: Monotonic convergence of a general algorithm for computing optimal designs
cites work: D-optimal designs via a cocktail algorithm
DOI: 10.1016/J.JSPI.2018.03.005
description: scientific article; zbMATH DE number 6892813