Pareto-efficient designs for multi- and mixed-level supersaturated designs
From MaRDI portal
Publication:6494384
DOI10.1007/S11222-023-10354-9MaRDI QIDQ6494384
Publication date: 30 April 2024
Published in: Statistics and Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs
- On construction of optimal mixed-level supersaturated designs
- Construction of optimal supersaturated designs by the packing method
- Construction of optimal multi-level supersaturated designs
- Multi-level \(k\)-circulant supersaturated designs
- Analysis of supersaturated designs via the Dantzig selector
- Construction of three-level supersaturated design
- Orthogonal arrays. Theory and applications
- A systematical procedure in the construction of multi-level supersaturated design.
- Combinatorial constructions for optimal supersaturated designs.
- Optimal mixed-level supersaturated design
- Three-level supersaturated designs
- On the construction of multi-level supersaturated designs
- Systematic enumeration of definitive screening designs
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Uniform supersaturated design and its construction
- Standardization and the Group Lasso Penalty
- Decoding by Linear Programming
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Some Systematic Supersaturated Designs
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- High-Dimensional Statistics
- Robust Recovery of Signals From a Structured Union of Subspaces
- Model Selection and Estimation in Regression with Grouped Variables
This page was built for publication: Pareto-efficient designs for multi- and mixed-level supersaturated designs
