D-optimal designs via a cocktail algorithm (Q88784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / publication date
 
8 September 2011
Timestamp+2011-09-08T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 8 September 2011 / rank
 
Normal rank
Property / author
 
Property / author: Yaming Yu / rank
 
Normal rank
Property / title
 
D-optimal designs via a cocktail algorithm (English)
Property / title: D-optimal designs via a cocktail algorithm (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1270.62107 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://arxiv.org/abs/0911.0108 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5946030 / rank
 
Normal rank
Property / zbMATH Keywords
 
D-optimality
Property / zbMATH Keywords: D-optimality / rank
 
Normal rank
Property / zbMATH Keywords
 
hybrid algorithm
Property / zbMATH Keywords: hybrid algorithm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105687256 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0911.0108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Experimental Designs for Properties of a Compartmental Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3445852 / 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: A vertex-exchange-method in D-optimal design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3427557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Übersichtsarbeiten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: General equivalence theory for optimum designs (approximate theory) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence of Two Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of mixture likelihoods: A general theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of optimal designs using a clustering approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849481 / 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: Estimation of Correlation Coefficients by Ellipsoidal Trimming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension-reduced nonparametric maximum likelihood computation for interval-censored data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Algorithm for Computation of the Nonparametric Maximum Likelihood Estimator From Censored Data / 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: Q5661044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic convergence of a general algorithm for computing optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:15, 4 July 2024

scientific article
Language Label Description Also known as
English
D-optimal designs via a cocktail algorithm
scientific article

    Statements

    21
    0 references
    4
    0 references
    475-481
    0 references
    9 June 2010
    0 references
    8 September 2011
    0 references
    0 references
    0 references
    D-optimal designs via a cocktail algorithm (English)
    0 references
    0 references
    D-optimality
    0 references
    hybrid algorithm
    0 references
    0 references
    0 references