Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.05098

Optimal control of cytotoxic and antiangiogenic therapies on prostate cancer growth

Pierluigi Colli·Hector Gomez·Guillermo Lorenzo·Gabriela Marinoschi·Alessandro Reali·Elisabetta Rocca
View original source ↗Read source document ↗Export metadata ↓

Abstract

Prostate cancer can be lethal in advanced stages, for which chemotherapy may become the only viable therapeutic option. While there is no clear clinical management strategy fitting all patients, cytotoxic chemotherapy with docetaxel is currently regarded as the gold standard. However, tumors may regain activity after treatment conclusion and become resistant to docetaxel. This situation calls for new delivery strategies and drug compounds enabling an improved therapeutic outcome. Combination of docetaxel with antiangiogenic therapy has been considered a promising strategy. Bevacizumab is the most common antiangiogenic drug, but clinical studies have not revealed a clear benefit from its combination with docetaxel. Here, we capitalize on our prior work on mathematical modeling of prostate cancer growth subjected to combined cytotoxic and antiangiogenic therapies, and propose an optimal control framework to robustly compute the drug-independent cytotoxic and antiangiogenic effects enabling an optimal therapeutic control of tumor dynamics. We describe the formulation of the optimal control problem, for which we prove the existence of at least a solution and determine the necessary first order optimality conditions. We then present numerical algorithms based on isogeometric analysis to run a preliminary simulation study over a single cycle of combined therapy. Our results suggest that only cytotoxic chemotherapy is required to optimize therapeutic performance and we show that our framework can produce superior solutions to combined therapy with docetaxel and bevacizumab. We also illustrate how the optimal drug-naïve cytotoxic effects computed in these simulations may be successfully leveraged to guide drug production and delivery strategies by running a nonlinear least-square fit of protocols involving docetaxel and a new design drug.

Explore related subjects

math.OCcs.CEq-bio.TO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pierluigi Colli, Hector Gomez, Guillermo Lorenzo, Gabriela Marinoschi, Alessandro Reali, Elisabetta Rocca. 2020-07-09. Optimal control of cytotoxic and antiangiogenic therapies on prostate cancer growth. https://arxiv.org/abs/2007.05098

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗