Pareto-efficient designs for multi- and mixed-level supersaturated designs

DOI10.1007/S11222-023-10354-9MaRDI QIDQ6494384zbMATH OpenFDO

Authors Rakhi Singh

Publication date 30 April 2024

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-023-10354-9

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Recommendations

• Optimal mixed-level supersaturated design
• Supersaturated design with more than two levels
• On the construction of multi-level supersaturated designs
• Optimality of mixed-level supersaturated designs
• Some theory and the construction of mixed-level supersaturated designs

Cites work

• A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs
• A systematical procedure in the construction of multi-level supersaturated design.
• Analysis of supersaturated designs via the Dantzig selector
• Combinatorial constructions for optimal supersaturated designs.
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• Consistency of the group Lasso and multiple kernel learning
• Construction of optimal multi-level supersaturated designs
• Construction of optimal supersaturated designs by the packing method
• Construction of three-level supersaturated design
• Decoding by Linear Programming
• High-dimensional statistics. A non-asymptotic viewpoint
• scientific article; zbMATH DE number 5957408 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Model Selection and Estimation in Regression with Grouped Variables
• Multi-level \(k\)-circulant supersaturated designs
• On construction of optimal mixed-level supersaturated designs
• On the construction of multi-level supersaturated designs
• Optimal mixed-level supersaturated design
• Orthogonal arrays. Theory and applications
• Robust Recovery of Signals From a Structured Union of Subspaces
• Some Systematic Supersaturated Designs
• Standardization and the group lasso penalty
• Systematic enumeration of definitive screening designs
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Three-level supersaturated designs
• Uniform supersaturated design and its construction
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: Pareto-efficient designs for multi- and mixed-level supersaturated designs

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