scientific article
From MaRDI portal
Publication:3657791
zbMath0512.90082MaRDI QIDQ3657791
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmmonotone convergenceconstrained minimizationapproximate optimal linear regression designestimation for a compound Poisson processstatitical applications
Linear regression; mixed models (62J05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Moment inequalities via optimal design theory ⋮ Most likely maximum entropy for population analysis with region-censored data ⋮ Minimum-volume ellipsoids containing compact sets: Application to parameter bounding ⋮ Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms ⋮ A class of optimization problems on minimizing variance based criteria in respect of parameter estimators of a linear model ⋮ I-robust and D-robust designs on a finite design space ⋮ A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria ⋮ Optimal experimental design and some related control problems ⋮ Removing non-optimal support points in \(D\)-optimum design algorithms. ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ A monte carlo study on minimizing chi-square distances under the hypothesis of homogeneity or independence for a two-way cotingeney table ⋮ 3-dimensional multivertex reconstruction from 2-dimensional tracks observations using likelihood inference ⋮ Monotonic convergence of a general algorithm for computing optimal designs ⋮ Multiplicative algorithms for computing optimum designs ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ Two classes of multiplicative algorithms for constructing optimizing distributions ⋮ Construction of marginally and conditionally restricted designs using multiplicative algorithms ⋮ Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices ⋮ Construction of Constrained Optimal Designs ⋮ Construction of optimal designs using a clustering approach
