Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
From MaRDI portal
Publication:4365698
DOI10.2307/1270905zbMath0889.62066OpenAlexW2023039737MaRDI QIDQ4365698
Publication date: 18 June 1998
Full work available at URL: https://doi.org/10.2307/1270905
Related Items
Construction of supersaturated designs involving \(s\)-level factors ⋮ Construction of \(E(s^2)\)-optimal supersaturated designs ⋮ MEASURES FOR EVALUATING NON-ORTHOGONALITY OF EXPERIMENTAL DESIGNS ⋮ Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm ⋮ Multi-level \(k\)-circulant supersaturated designs ⋮ Supersaturated designs of projectivity \(P=3\) or near \(P=3\) ⋮ Construction of three-level supersaturated design ⋮ Supersaturated designs: a review of their construction and analysis ⋮ A general construction of \(E(f_{NOD})\)-optimal multi-level supersaturated designs ⋮ Optimal selection and ordering of columns in supersaturated designs ⋮ \(E(\chi ^{2})\)-optimal mixed-level supersaturated designs ⋮ Indicator function and its application in two-level factorial designs ⋮ An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs ⋮ Construction methods for three-level supersaturated designs based on weighing matrices. ⋮ A comparison of design and model selection methods for supersaturated experiments ⋮ A new method of construction of multi-level supersaturated designs. ⋮ Combinatorial constructions for optimal supersaturated designs. ⋮ \(E(s^{2})\)-optimal supersaturated designs with good minimax properties ⋮ Optimal mixed-level supersaturated designs and a new class of combinatorial designs ⋮ Cyclicly constructed \(E(s^{2})\)-optimal supersaturated designs ⋮ A new method in the construction of two-level supersaturated designs ⋮ On the construction of multi-level supersaturated designs ⋮ Lean optimization using supersaturated experimental design ⋮ \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V ⋮ Model-robust supersaturated and partially supersaturated designs ⋮ Orthogonal subsampling for big data linear regression ⋮ Bayesian D-optimal supersaturated designs ⋮ Supersaturated designs with high searching probability ⋮ A general construction method for mixed-level supersaturated design ⋮ Optimal Latin hypercube designs for the Kullback-Leibler criterion ⋮ An efficient algorithm for constructing optimal design of computer experiments ⋮ Optimal multi-level supersaturated designs constructed from linear and quadratic functions ⋮ On multi-level supersaturated designs ⋮ Uniform supersaturated design and its construction ⋮ Three-level supersaturated designs ⋮ Construction of mixed-level supersaturated design ⋮ Construction of minimum generalized aberration designs ⋮ 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 ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics ⋮ Analysis of supersaturated designs via the Dantzig selector ⋮ Optimal designs in sparse linear models ⋮ Optimal supersaturated designs for \(s^m\) factorials in \(N \not\equiv 0 \pmod s\) runs ⋮ Two-level supersaturated designs: a review ⋮ Screening designs for model discrimination ⋮ R-optimal two-level supersaturated designs ⋮ Algorithmic construction of optimal symmetric Latin hypercube designs. ⋮ Construction of some \(E(f_{NOD})\) optimal mixed-level supersaturated designs ⋮ Construction of \(E(s^2)\) optimal supersaturated designs using cyclic BIBDs ⋮ Optimality of mixed-level supersaturated designs ⋮ Construction of optimal multi-level supersaturated designs
