Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Abstract Tumor microenvironment (TME) normalization improves efficacy by increasing anticancer nanocarrier delivery by restoring transvascular pressure gradients that induce convection. However, transport depends on TME biophysics, normalization dose, and nanocarrier size. With increased understanding, we could use computation to personalize normalization amount and nanocarrier size. Here, we use deterministic global dynamic optimization with novel bounding routines to validate mechanistic models against
in vivo data. We find that normalization with dexamethasone increases the maximum transvascular convection rate of nanocarriers by 48‐fold, the tumor volume fraction with convection by 61%, and the total amount of convection by 360%. Nonetheless, 22% of the tumor still lacks convection. These findings underscore both the effectiveness and limits of normalization. Using artificial neural network surrogate modeling, we demonstrate the feasibility of rapidly determining the dexamethasone dose and nanocarrier size to maximize accumulation. Thus, this digital testbed quantifies transport and performs therapy design. -
Abstract We present a deterministic global optimization method for nonlinear programming formulations constrained by stiff systems of ordinary differential equation (ODE) initial value problems (IVPs). The examples arise from dynamic optimization problems exhibiting both fast and slow transient phenomena commonly encountered in model‐based systems engineering applications. The proposed approach utilizes unconditionally stable implicit integration methods to reformulate the ODE‐constrained problem into a nonconvex nonlinear program (NLP) with implicit functions embedded. This problem is then solved to global optimality in finite time using a spatial branch‐and‐bound framework utilizing convex/concave relaxations of implicit functions constructed by a method which fully exploits problem sparsity. The algorithms were implemented in the Julia programming language within the EAGO.jl package and demonstrated on five illustrative examples with varying complexity relevant in process systems engineering. The developed methods enable the guaranteed global solution of dynamic optimization problems with stiff ODE–IVPs embedded.