Improvements on removing nonoptimal support points in D-optimum design algorithms

By Radoslav Harman, Luc Pronzato. 2007

71 citations recorded by the source corpus.

We improve the inequality used in Pronzato [2003. Removing non-optimal support points in D-optimum design algorithms. Statist. Probab. Lett. 63, 223-228] to remove points from the design space during the search for a D-optimum design. Let [xi] be any design on a compact space with a nonsingular information matrix, and let m+[epsilon] be the maximum of the variance function d([xi],x) over all . We prove that any support point x* of a D-optimum design on must satisfy the inequality . We show that this new lower bound on d([xi],x*) is, in a sense, the best possible, and how it can be used to accelerate algorithms for D-optimum design.

Subfields: Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/5c9ed72f2faa41b090b9ef54a3af2aae6322242d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Yaming Yu
  2. Luc Pronzato
  3. Andrej Pázman
  4. Werner G. Müller

In Industrial and Manufacturing Engineering

  1. Yaming Yu
  2. Luc Pronzato

In Management Science and Operations Research

  1. Yaming Yu
  2. Luc Pronzato
  3. Andrej Pázman
  4. Werner G. Müller

Citations in the corpus