We consider a multi-compartment evolutionary model representing growth, mutation and migration of cancer cells, as well as the effect of drugs, and we design optimal switching targeted cancer therapies where a single drug, or suitable drug combination, is given at each time so as to minimise not only the overall tumor size over a finite horizon, but also drug-provoked side effects. The strong diagonally- dominant structure of the model allows to solve the problem via convex optimisation. We provide an algorithm that yields optimality throughout the whole treatment duration by solving the convex optimisation problem with different horizons, and show how dwell time can be enforced via heuristics. Also the optimal treatment duration can be computed via convex optimisation. The proposed approaches are applied to a model of ALK-rearranged lung carcinoma.
Optimal duration and planning of switching treatments taking drug toxicity into account: A convex optimisation approach / Devia, Carlos Andres; Giordano, Giulia. - 2019:(2019), pp. 5674-5679. (Intervento presentato al convegno 58th IEEE Conference on Decision and Control, CDC 2019 tenutosi a Acropolis Convention Centre, Nice nel 2019) [10.1109/CDC40024.2019.9028881].
Optimal duration and planning of switching treatments taking drug toxicity into account: A convex optimisation approach
Giordano, Giulia
2019-01-01
Abstract
We consider a multi-compartment evolutionary model representing growth, mutation and migration of cancer cells, as well as the effect of drugs, and we design optimal switching targeted cancer therapies where a single drug, or suitable drug combination, is given at each time so as to minimise not only the overall tumor size over a finite horizon, but also drug-provoked side effects. The strong diagonally- dominant structure of the model allows to solve the problem via convex optimisation. We provide an algorithm that yields optimality throughout the whole treatment duration by solving the convex optimisation problem with different horizons, and show how dwell time can be enforced via heuristics. Also the optimal treatment duration can be computed via convex optimisation. The proposed approaches are applied to a model of ALK-rearranged lung carcinoma.File | Dimensione | Formato | |
---|---|---|---|
09028881.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
783.76 kB
Formato
Adobe PDF
|
783.76 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione