On a class of algorithms from experimental design theory (Q4327907): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939208843782 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082108339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Efficient Designs of Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences converging to D-optimal designs of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent design sequences, for sufficiently regular optimality criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent design sequences, for sufficiently regular optimality criteria, II: Singular case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical estimation of a probability measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vertex-exchange-method in D-optimal design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical techniques for estimating probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the numerical estimation of probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional derivatives of optimality criteria at singular matrices in convex design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayes, Admissible, and Minimax Linear Estimators in Linear Models with Restricted Parameter Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3034704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing pseudoconvex functions on convex compact sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax linear regression estimation with symmetric parameter restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear regression designs which maximize information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for optimal designs on a design space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimax estimation in linear regression: theoretical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some algorithmic aspects of the theory of optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some iterative procedures for generating nonsingular optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covergence of general step-length algorithms for regular optimum design criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sequential Generation of $D$-Optimum Experimental Designs / rank
 
Normal rank

Latest revision as of 11:27, 23 May 2024

scientific article; zbMATH DE number 737322
Language Label Description Also known as
English
On a class of algorithms from experimental design theory
scientific article; zbMATH DE number 737322

    Statements

    On a class of algorithms from experimental design theory (English)
    0 references
    0 references
    0 references
    0 references
    4 August 1996
    0 references
    gradient
    0 references
    stopping criterion
    0 references
    optimal design
    0 references
    linear minimax estimation
    0 references
    convex minimization
    0 references
    0 references
    0 references
    0 references

    Identifiers