More Like this

1. Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup times

   https://doi.org/10.1016/j.peva.2023.102377  

   Hong, Yige; Scully, Ziv (January 2024, Performance Evaluation)
2. Elmendorf constructions for $$G$$-categories and $$G$$-posets

   https://doi.org/10.1090/proc/15563  

   Rubin, Jonathan (September 2021, Proceedings of the American Mathematical Society)
3. A 3‐categorical perspective on G$$G$$‐crossed braided categories

   https://doi.org/10.1112/jlms.12687  

   Jones, Corey; Penneys, David; Reutter, David (January 2023, Journal of the London Mathematical Society)
4. ON CATEGORIES OF ADMISSIBLE ( g $$ \mathfrak{g} $$ , sl(2))-MODULES

   https://doi.org/10.1007/s00031-017-9458-1  

   PENKOV, I.; SERGANOVA, V.; ZUCKERMAN, G. (June 2018, Transformation Groups)
5. A non‐approximate method for generating G$$G$$‐optimal RSM designs

   https://doi.org/10.1002/qre.3660  

   Hansen, Hyrum J; Walsh, Stephen J; Pan, Rong (September 2024, Quality and Reliability Engineering International)

   We present a nonapproximate computational method for generating ‐optimal designs in response surface methodology (RSM) settings usingGloptipoly, a global polynomial optimizer. Traditional approaches use a grid approximation for computing a candidate design's ‐score.Gloptipolycan find the global optimum of high‐order polynomials thus making it suitable for computing a design's ‐score, that is, its maximum scaled prediction variance, which, for second‐order models, is a quartic polynomial function of the experimental factors. We demonstrate the efficacy and performance of our method through comprehensive application to well‐published examples, and illustrate, for the first time, its application to generating ‐optimal designs supporting models of order greater than 2. This work represents the first non‐approximate computational approach to solving the ‐optimal design problem. This advancement opens new possibilities for finding ‐optimal designs beyond second‐order RSM models. 

   more » « less