Finding D-optimal designs by randomised decomposition and switching

MaRDI QIDQ2869287zbMATH OpenFDO

Authors Richard P. Brent

Publication date 3 January 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.4671, http://ajc.maths.uq.edu.au/pdf/55/ajc_v55_p015.pdf

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Abstract: The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases where n > 2 is not divisible by 4, so the Hadamard bound is not attainable, but bounds due to Barba or Ehlich and Wojtas may be attainable. If R is a matrix with maximal (or conjectured maximal) determinant, then G = RR^T is the corresponding Gram matrix. For the cases that we consider, maximal or conjectured maximal Gram matrices are known. We show how to generate many Hadamard equivalence classes of solutions from a given Gram matrix G, using a randomised decomposition algorithm and row/column switching. In particular, we consider orders 26, 27 and 33, and obtain new saturated D-optimal designs (for order 26) and new conjectured saturated D-optimal designs (for orders 27 and 33).

Recommendations

• Simulations on the combinatorial structure of \(D\)-optimal designs
• A combinatorial procedure for constructing \(D\)-optimal exact designs
• On the structure of \(D\)-optimal designs of experiments
• D-optimal designs via a cocktail algorithm
• scientific article; zbMATH DE number 11979
• An algorithm for the simultaneous construction ofD-optimal experimental designs
• Maximin efficient designs. Another view at D-optimality
• On the enumeration of some D-optimal designs
• On the number of \(D\)-optimal designs

Cited in

(9)

• D-optimal designs and group divisible designs
• A feasibility approach for constructing combinatorial designs of circulant type
• On the enumeration of some D-optimal designs
• D-optimal matrices via quadratic integer optimization
• \(D\)-optimal designs with Hadamard matrix
• \(D\)-optimal designs embedded in Hadamard matrices and their effect on the pivot patterns
• PAF reconstruction with the orbits method
• The D-optimal saturated designs of order 22
• D-optimal matrices of orders 118, 138, 150, 154 and 174

This page was built for publication: Finding D-optimal designs by randomised decomposition and switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869287)