Adaptive grid semidefinite programming for finding optimal designs

We find optimal designs for linear models using anovel algorithm that iteratively combines a semidefinite programming(SDP) approach with adaptive grid techniques.The proposed algorithm is also adapted to find locally optimaldesigns for nonlinear models. The search space is firstdiscretized, and SDP is applied to find the optimal designbased on the initial grid. The points in the next grid set arepoints that maximize the dispersion function of the SDPgeneratedoptimal design using nonlinear programming. Theprocedure is repeated until a user-specified stopping rule isreached. The proposed algorithm is broadly applicable, andwe demonstrate its flexibility using (i) models with one ormore variables and (ii) differentiable design criteria, suchas A-, D-optimality, and non-differentiable criterion like Eoptimality,including the mathematically more challengingcasewhen theminimum eigenvalue of the informationmatrixof the optimal design has geometric multiplicity larger than 1. Our algorithm is computationally efficient because it isbased on mathematical programming tools and so optimalityis assured at each stage; it also exploits the convexity of theproblems whenever possible. Using several linear and nonlinearmodelswith one or more factors, we showthe proposedalgorithm can efficiently find optimal designs

Optimal exact designs of experiments via Mixed Integer Nonlinear Programming

Optimal exact designs are problematic to find and study because there is no unified theory for determining them and studyingtheir properties. Each has its own challenges and when a method exists to confirm the design optimality, it is invariablyapplicable to the particular problem only.We propose a systematic approach to construct optimal exact designs by incorporatingthe Cholesky decomposition of the Fisher Information Matrix in a Mixed Integer Nonlinear Programming formulation. Asexamples, we apply the methodology to find D- and A-optimal exact designs for linear and nonlinear models using global orlocal optimizers. Our examples include design problems with constraints on the locations or the number of replicates at theoptimal design points

A Metaheuristic Adaptive Cubature Based Algorithm to Find Bayesian Optimal Designs for Nonlinear Models

Finding Bayesian optimal designs for nonlinear models is a difficult task because the optimality criteriontypically requires us to evaluate complex integrals before we perform a constrained optimization. Wepropose a hybridized method where we combine an adaptive multidimensional integration algorithm anda metaheuristic algorithm called imperialist competitive algorithm to find Bayesian optimal designs. Weapply our numerical method to a few challenging design problems to demonstrate its efficiency. Theyinclude finding D-optimal designs for an item response model commonly used in education, Bayesianoptimal designs for survivalmodels, and Bayesian optimal designs for a four-parameter sigmoid Emax doseresponse model. Supplementary materials for this article are available online and they contain an R packagefor implementing the proposed algorithm and codes for reproducing all the results in this paper

Adaptive grid semidefinite programming for finding optimal designs

We find optimal designs for linear models using a novel algorithm that iteratively combines a Semidefinite Programming (SDP) approach with adaptive grid (AG) techniques. The search space is first discretized and SDP is applied to find the optimal design based on the initial grid. The points in the next grid set are points that maximize the dispersion function of the SDP-generated optimal design using Nonlinear Programming (NLP). The procedure is repeated until a user-specified stopping rule is reached. The proposed algorithm is broadly applicable and we demonstrate its flexibility using (i) models with one or more variables, and (ii) differentiable design criteria, such as A-, D-optimality, and non-differentiable criterion like E-optimality, including the mathematically more challenging case when the minimum eigenvalue of the information matrix of the optimal design has geometric multiplicity larger than 1. Our algorithm is computationally efficient because it is based on mathematical programming tools and so optimality is assured at each stage; it also exploits the convexity of the problems whenever possible. Using several linear models, we show the proposed algorithm can efficiently find both old and new optimal designs

Using hierarchical information-theoretic criteria to optimize subsampling of extensive datasets

This paper addresses the challenge of subsampling large datasets, aiming to generate a smaller dataset that retains a significant portion of the original information. To achieve this objective, we present a subsampling algorithm that integrates hierarchical data partitioning with a specialized tool tailored to identify the most informative observations within a dataset for a specified underlying linear model, not necessarily first-order, relating responses and inputs. The hierarchical data partitioning procedure systematically and incrementally aggregates information from smaller-sized samples into new samples. Simultaneously, our selection tool employs Semidefinite Programming for numerical optimization to maximize the information content of the chosen observations. We validate the effectiveness of our algorithm through extensive testing, using both benchmark and real-world datasets. The real-world dataset is related to the physicochemical characterization of white variants of Portuguese Vinho Verde. Our results are highly promising, demonstrating the algorithm's capability to efficiently identify and select the most informative observations while keeping computational requirements at a manageable level

Randomizing a clinical trial in neuro-degenerative disease

The paper studies randomization rules for a sequential two-treatment, two-site clinical trial in Parkinson’s disease. An important feature is that we have values of responses and five potential prognostic factors from a sample of 144 patients similar to those to be enrolled in the trial. Analysis of this sample provides a model for trial analysis. The comparison of allocation rules is made by simulation yielding measures of loss due to imbalance and of potential bias. A major novelty of the paper is the use of this sample, via a two-stage algorithm, to provide an empirical distribution of covariates for the simulation; sampling of a correlated multivariate normal distribution is followed by transformation to variables following the empirical marginal distributions. Six allocation rules are evaluated. The paper concludes with some comments on general aspects of the evaluation of such rules and provides a recommendation for two allocation rules, one for each site, depending on the target number of patients to be enrolled

A model-based framework assisting the design of vapor-liquid equilibrium experimental plans

In this paper we propose a framework for Model-based Sequential Optimal Design of Experiments to assist experimenters involved in Vapor-Liquid equilibrium characterization studies to systematically construct thermodynamically consistent models. The approach uses an initial continuous optimal design obtained via semidefinite programming, and then iterates between two stages (i) model fitting using the information available; and (ii) identification of the next experiment, so that the information content in data is maximized. The procedure stops when the number of experiments reaches the maximum for the experimental program or the dissimilarity between the parameter estimates during two consecutive iterations is below a given threshold. This methodology is exemplified with the D-optimal design of isobaric experiments, for characterizing binary mixtures using the NRTL and UNIQUAC thermodynamic models for liquid phase. Significant reductions of the confidence regions for the parameters are achieved compared with experimental plans where the observations are uniformly distributed over the domain

Atividade antimicrobiana de extratos hidroalcólicos de espécies da coleção de plantas medicinais CPQBA/UNICAMP

Extratos obtidos a partir de 45 espécies da Coleção de Germoplasmas do CPQBA foram estudados quanto à atividade antimicrobiana. As espécies que apresentaram forte inibição (Concentração Mínima Inibitória até 0,5 mg/mL) para os respectivos microrganismos foram: Achillea millefolium (0,5), Mikania laevigata (0,04), Solidago chilensis (0,1), Piper marginatum (0,2) para Staphylococcus aureus; Aloysia gratissima (0,1), P. marginatum (0,2), M. laevigata (0,09) para Bacillus subtilis e Mentha pullegium (0,3), Mikania glomerata (0,1), M. laevigata (0,04), Stachytarpeta cayenensis (0,2) e Bacharis dracunculifolia (0,5) para Streptococcus faecium. De acordo com os resultados, ressaltamos a espécie M. laevigata por apresentar inibição contra três das bactérias estudadas, em concentrações similares a do cloranfenicol, padrão de referência utilizado

Optimal design of experiments for liquid–liquid equilibria characterization via semidefinite programming

Liquid–liquid equilibria (LLE) characterization is a task requiring considerable work and appreciable financial resources. Notable savings in time and effort can be achieved when the experimental plans use the methods of the optimal design of experiments that maximize the information obtained. To achieve this goal, a systematic optimization formulation based on Semidefinite Programming is proposed for finding optimal experimental designs for LLE studies carried out at constant pressure and temperature. The non-random two-liquid (NRTL) model is employed to represent species equilibria in both phases. This model, combined with mass balance relationships, provides a means of computing the sensitivities of the measurements to the parameters. To design the experiment, these sensitivities are calculated for a grid of candidate experiments in which initial mixture compositions are varied. The optimal design is found by maximizing criteria based on the Fisher Information Matrix (FIM). Three optimality criteria (D-, A- and E-optimal) are exemplified. The approach is demonstrated for two ternary systems where different sets of parameters are to be estimated