IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1010322.html

Fides: Reliable trust-region optimization for parameter estimation of ordinary differential equation models

Author

Listed:
  • Fabian Fröhlich
  • Peter K Sorger

Abstract

Ordinary differential equation (ODE) models are widely used to study biochemical reactions in cellular networks since they effectively describe the temporal evolution of these networks using mass action kinetics. The parameters of these models are rarely known a priori and must instead be estimated by calibration using experimental data. Optimization-based calibration of ODE models on is often challenging, even for low-dimensional problems. Multiple hypotheses have been advanced to explain why biochemical model calibration is challenging, including non-identifiability of model parameters, but there are few comprehensive studies that test these hypotheses, likely because tools for performing such studies are also lacking. Nonetheless, reliable model calibration is essential for uncertainty analysis, model comparison, and biological interpretation.We implemented an established trust-region method as a modular Python framework (fides) to enable systematic comparison of different approaches to ODE model calibration involving a variety of Hessian approximation schemes. We evaluated fides on a recently developed corpus of biologically realistic benchmark problems for which real experimental data are available. Unexpectedly, we observed high variability in optimizer performance among different implementations of the same mathematical instructions (algorithms). Analysis of possible sources of poor optimizer performance identified limitations in the widely used Gauss-Newton, BFGS and SR1 Hessian approximation schemes. We addressed these drawbacks with a novel hybrid Hessian approximation scheme that enhances optimizer performance and outperforms existing hybrid approaches. When applied to the corpus of test models, we found that fides was on average more reliable and efficient than existing methods using a variety of criteria. We expect fides to be broadly useful for ODE constrained optimization problems in biochemical models and to be a foundation for future methods development.Author summary: In cells, networks of biochemical reactions involving complex, time-dependent interactions among proteins and other biomolecules regulate diverse processes like signal transduction, cell division, and development. Precise understanding of the time-evolution of these networks requires the use of dynamical models, among which mass-action models based on ordinary differential equations are both powerful and tractable. However, for these models to capture the specifics of a particular cellular process, their parameters must be estimated by minimizing the difference between the simulation (of a dynamical variable such as a particular protein concentration) and experimental data (this is the process of model calibration). This is a difficult and computation-intensive process that has previously been tackled using a range of mathematical techniques whose strengths and weaknesses are not fully understood. In this manuscript, we describe a new software tool, fides, that makes rigorous comparison of calibration methods possible. Unexpectedly, we find that different software implementations of the same mathematical method vary in performance. Using fides, we analyze the causes of this variability, evaluate multiple improvements, and implement a set of generally useful methods and metrics for use in future modeling studies.

Suggested Citation

  • Fabian Fröhlich & Peter K Sorger, 2022. "Fides: Reliable trust-region optimization for parameter estimation of ordinary differential equation models," PLOS Computational Biology, Public Library of Science, vol. 18(7), pages 1-28, July.
  • Handle: RePEc:plo:pcbi00:1010322
    DOI: 10.1371/journal.pcbi.1010322
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1010322
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1010322&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1010322?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Nicholas Gould & Dominique Orban & Philippe Toint, 2015. "CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization," Computational Optimization and Applications, Springer, vol. 60(3), pages 545-557, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huang, Yu & Liu, Changqing & Yan, Shiyi & Qin, Yanyan & Wang, Hao, 2025. "Eco-driving strategy for connected automated vehicles at signalized intersections: A behavior-cloning approach in distributed model predictive control," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 676(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yixin Xie & Cong Sun & Ya-Xiang Yuan, 2025. "Adaptive cyclic gradient methods with interpolation," Computational Optimization and Applications, Springer, vol. 92(1), pages 301-325, September.
    2. David J. Eckman & Shane G. Henderson & Sara Shashaani, 2023. "Diagnostic Tools for Evaluating and Comparing Simulation-Optimization Algorithms," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 350-367, March.
    3. Brian Irwin & Eldad Haber, 2023. "Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition," Computational Optimization and Applications, Springer, vol. 84(3), pages 651-702, April.
    4. Matteo Lapucci & Alessio Sortino, 2024. "On the Convergence of Inexact Alternate Minimization in Problems with $$\ell _0$$ ℓ 0 Penalties," SN Operations Research Forum, Springer, vol. 5(2), pages 1-11, June.
    5. S. Gratton & Ph. L. Toint, 2020. "A note on solving nonlinear optimization problems in variable precision," Computational Optimization and Applications, Springer, vol. 76(3), pages 917-933, July.
    6. Lahcen El Bourkhissi & Ion Necoara, 2025. "Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints," Journal of Global Optimization, Springer, vol. 91(3), pages 483-510, March.
    7. Albert S. Berahas & Michael J. O’Neill & Clément W. Royer, 2026. "A line search framework with restarting for noisy optimization problems," Computational Optimization and Applications, Springer, vol. 93(3), pages 899-920, April.
    8. Yutao Zheng & Bing Zheng, 2017. "Two New Dai–Liao-Type Conjugate Gradient Methods for Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 502-509, November.
    9. Giovanni Fasano & Massimo Roma, 2016. "A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 399-429, November.
    10. Yonggang Pei & Shaofang Song & Detong Zhu, 2023. "A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization," Computational Optimization and Applications, Springer, vol. 84(3), pages 1005-1033, April.
    11. José Luis Romero & Damián Fernández & Germán Ariel Torres, 2026. "Enhancing Sharp Augmented Lagrangian Methods with Smoothing Techniques for Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 208(1), pages 1-43, January.
    12. A. L. Custódio & R. Garmanjani & M. Raydan, 2024. "Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization," 4OR, Springer, vol. 22(1), pages 121-144, March.
    13. Mehiddin Al-Baali & Andrea Caliciotti & Giovanni Fasano & Massimo Roma, 2017. "Exploiting damped techniques for nonlinear conjugate gradient methods," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 501-522, December.
    14. Ashkan Sadeghi-Lotfabadi & Kamaledin Ghiasi-Shirazi, 2025. "Speeding up L-BFGS by direct approximation of the inverse Hessian matrix," Computational Optimization and Applications, Springer, vol. 91(1), pages 283-310, May.
    15. M. Ahmadvand & M. Esmaeilbeigi & A. Kamandi & F. M. Yaghoobi, 2019. "A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques," Computational Optimization and Applications, Springer, vol. 72(2), pages 499-524, March.
    16. Nicolas Boutet & Rob Haelterman & Joris Degroote, 2021. "Secant Update generalized version of PSB: a new approach," Computational Optimization and Applications, Springer, vol. 78(3), pages 953-982, April.
    17. Zexian Liu & Yan Ni & Hongwei Liu & Wumei Sun, 2024. "A New Subspace Minimization Conjugate Gradient Method for Unconstrained Minimization," Journal of Optimization Theory and Applications, Springer, vol. 200(2), pages 820-851, February.
    18. E. G. Birgin & J. L. Gardenghi & J. M. Martínez & S. A. Santos, 2021. "On the solution of linearly constrained optimization problems by means of barrier algorithms," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 417-441, July.
    19. repec:bcp:journl:v:10:y:2026:i:6:p:15622-15633 is not listed on IDEAS
    20. Yaguang Yang, 2025. "An arc-search interior-point algorithm for nonlinear constrained optimization," Computational Optimization and Applications, Springer, vol. 90(3), pages 969-995, April.
    21. Andrea Cristofari & Gianni Di Pillo & Giampaolo Liuzzi & Stefano Lucidi, 2022. "An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 300-323, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1010322. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.