A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
From MaRDI portal
Publication:2439646
DOI10.1016/j.spl.2013.09.009zbMath1463.62229arXiv1303.5046MaRDI QIDQ2439646
Publication date: 14 March 2014
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.5046
62K05: Optimal statistical designs
90C46: Optimality conditions and duality in mathematical programming
Related Items
On the elimination of inessential points in the smallest enclosing ball problem, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, Multiplicative methods for computing \(D\)-optimal stratified designs of experiments, Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria, Removing inessential points in \(c\)-and \(A\)-optimal design, Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space, Convex relaxation for IMSE optimal design in random-field models, Removal of the points that do not support an \(E\)-optimal experimental design, Measures minimizing regularized dispersion, Computing minimum-volume enclosing ellipsoids for large datasets, An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso, A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- The geometry of mixture likelihoods: A general theory
- A vertex-exchange-method in D-optimal design theory
- General equivalence theory for optimum designs (approximate theory)
- Some algorithmic aspects of the theory of optimal designs
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Removing non-optimal support points in \(D\)-optimum design algorithms.
- Optimum designs for multi-factor models
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- An algorithm for optimal designs on a design space
- A maximum likelihood estimation method for random coefficient regression models
- Rounding of Polytopes in the Real Number Model of Computation
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
