\(E(s^{2})\)-optimal supersaturated designs with good minimax properties

DOI10.1016/j.jspi.2006.07.008zbMath1120.62059OpenAlexW1994432073MaRDI QIDQ2455711

Kenneth J. Ryan, Dursun A. Bulutoglu

Publication date: 26 October 2007

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2006.07.008

zbMATH Keywords

lower boundsupersaturated designminimax criterioninitial designsNOA\(_{k}\) algorithmsrow swapping algorithms

Mathematics Subject Classification ID

Related Items (29)

Supersaturated designs of projectivity \(P=3\) or near \(P=3\) ⋮ A method for analyzing supersaturated designs inspired by control charts ⋮ Sure independence screening for analyzing supersaturated designs ⋮ A new lower bound to \(A_{2}\)-optimality measure for multi-level and mixed-level column balanced designs and its applications ⋮ Supersaturated designs: a review of their construction and analysis ⋮ A general construction of \(E(f_{NOD})\)-optimal multi-level supersaturated designs ⋮ The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60 ⋮ An overview of two-level supersaturated designs with cyclic structure ⋮ Constructing \(E(s^2)\)-optimal and minimax-optimal \(k\)-circulant supersaturated designs via multi-objective tabu search ⋮ An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs ⋮ A comparison of design and model selection methods for supersaturated experiments ⋮ Cyclicly constructed \(E(s^{2})\)-optimal supersaturated designs ⋮ On \(E(s^2)\)-optimal supersaturated designs ⋮ A Variable Selection Method for Analyzing Supersaturated Designs ⋮ Two-level supersaturated designs for \(2^k\) runs and other cases ⋮ A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs ⋮ On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs ⋮ \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing ⋮ E\((s^{2})\)-optimal supersaturated designs with good minimax properties when \(N\) is odd ⋮ \(E(s^2)\)-optimal supersaturated designs with odd number of runs ⋮ On the construction of \(E(s^2)\)-optimal supersaturated designs ⋮ A general construction of \(E(s^2)\)-optimal large supersaturated designs ⋮ A general construction of \(E(s^2)\)-optimal supersaturated designs via supplementary difference sets ⋮ Analysis of supersaturated designs via the Dantzig selector ⋮ A New Method for the Analysis of Supersaturated Designs with Discrete Data ⋮ Exploring \(k\)-circulant supersaturated designs via genetic algorithms ⋮ Optimal supersaturated designs for \(s^m\) factorials in \(N \not\equiv 0 \pmod s\) runs ⋮ Two-level supersaturated designs: a review ⋮ R-optimal two-level supersaturated designs

Uses Software

• GAP

Cites Work

• Unnamed Item
• Hidden projection properties of some nonregular fractional factorial designs and their applications
• Construction of \(E(s^2)\) optimal supersaturated designs using cyclic BIBDs
• Construction of \(E(s^2)\)-optimal supersaturated designs
• Cyclicly constructed \(E(s^{2})\)-optimal supersaturated designs
• A General Method of Constructing E(s2)-Optimal Supersaturated Designs
• An Algorithmic Approach to Constructing Supersaturated Designs
• Another Look at First-Order Saturated Designs: The p-Efficient Designs
• Some Systematic Supersaturated Designs
• Construction of supersaturated designs through partially aliased interactions
• A method for constructing supersaturated designs and its Es² optimality
• Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
• Large supersaturated designs
• Generating Systematic Supersaturated Designs

This page was built for publication: \(E(s^{2})\)-optimal supersaturated designs with good minimax properties