Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.

Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems

Open access
Miró, Anton, Pozo, Carlos, Guillén-Gosálbez, Gonzalo, Egea, Jose A, Jiménez, Laureano · 2012 · BMC Bioinformatics

Abstract

Background: The estimation of parameter values for mathematical models of biological systems is an optimization problem that is particularly challenging due to the nonlinearities involved. One major difficulty is the existence of multiple minima in which standard optimization methods may fall during the search. Deterministic global optimization methods overcome this limitation, ensuring convergence to the global optimum within a desired tolerance. Global optimization techniques are usually classified into stochastic and deterministic. The former typically lead to lower CPU times but offer no guarantee of convergence to the global minimum in a finite number of iterations. In contrast, deterministic methods provide solutions of a given quality (i.e., optimality gap), but tend to lead to large computational burdens. Results: This work presents a deterministic outer approximation-based algorithm for the global optimization of dynamic problems arising in the parameter estimation of models of biological systems. Our approach, which offers a theoretical guarantee of convergence to global minimum, is based on reformulating the set of ordinary differential equations into an equivalent set of algebraic equations through the use of orthogonal collocation methods, giving rise to a nonconvex nonlinear programming (NLP) problem. This nonconvex NLP is decomposed into two hierarchical levels: a master mixed-integer linear programming problem (MILP) that provides a rigorous lower bound on the optimal solution, and a reduced-space slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied. Conclusion: The capabilities of our approach were tested in two benchmark problems, in which the performance of our algorithm was compared with that of the commercial global optimization package BARON. The proposed strategy produced near optimal solutions (i.e., within a desired tolerance) in a fraction of the CPU time required by BARON.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1186/1471-2105-13-90

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Solution Strategy. The system of ODEs is first reformulated into a nonconvex NLP using the orthogonal collocation on finite elements approach. This NLP is decomposed into two levels: a master MILP and a slave NLP. The master MILP, which is constructed using piecewise McCormick envelopes and supporting hyper-planes, provides a rigorous lower bound on the global optimum. The slave NLP corresponds to the original nonconvex NLP that is solved using as starting point the solution of the MILP. The algorithm iterates between these two levels until the optimality gap (i.e., the relative difference between the upper and lower bounds) is reduced below a given tolerance.
Figure 1 Solution Strategy. The system of ODEs is first reformulated into a nonconvex NLP using the orthogonal collocation on finite elements approach. This NLP is decomposed into two levels: a master MILP and a slave NLP. The master MILP, which is constructed using piecewise McCormick envelopes and supporting hyper-planes, provides a rigorous lower bound on the global optimum. The slave NLP corresponds to the original nonconvex NLP that is solved using as starting point the solution of the MILP. The algorithm iterates between these two levels until the optimality gap (i.e., the relative difference between the upper and lower bounds) is reduced below a given tolerance.CC BY · PubMed Central
Figure 2 Orthogonal collocation discretization over finite elements. The time interval is divided into NE elements which in turn are divided into NK + 1 collocation points evaluated at the shifted orthogonal Legendre polynomials.
Figure 2 Orthogonal collocation discretization over finite elements. The time interval is divided into NE elements which in turn are divided into NK + 1 collocation points evaluated at the shifted orthogonal Legendre polynomials.CC BY · PubMed Central
Figure 3 Optimization algorithm based on outer approximation. Our approach decomposes the problem into two subproblems: a master MILP, constructed by relaxing the original model using piecewise McCormick envelopes and hyper-planes, that provides a lower bound, and a slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied.
Figure 3 Optimization algorithm based on outer approximation. Our approach decomposes the problem into two subproblems: a master MILP, constructed by relaxing the original model using piecewise McCormick envelopes and hyper-planes, that provides a lower bound, and a slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied.CC BY · PubMed Central
Figure 4 McCormick convex relaxation over the entire feasible region (subfigure (a)) compared to a piecewise McCormick relaxation over a smaller active region (subfigure (b)) where the tightness of the relaxation is improved. We built the master problem by replacing the bilinear terms by piecewise McCormick envelopes. The relaxation can be further improved by adding binary variables.
Figure 4 McCormick convex relaxation over the entire feasible region (subfigure (a)) compared to a piecewise McCormick relaxation over a smaller active region (subfigure (b)) where the tightness of the relaxation is improved. We built the master problem by replacing the bilinear terms by piecewise McCormick envelopes. The relaxation can be further improved by adding binary variables.CC BY · PubMed Central
Figure 5 x squared function underestimated by a 1st degree Taylor series. The objective function is linearized by a first degree Taylor series with l hyper-planes.
Figure 5 x squared function underestimated by a 1st degree Taylor series. The objective function is linearized by a first degree Taylor series with l hyper-planes.CC BY · PubMed Central
Figure 6 Proposed mechanism describing the thermal isomerization of α-Pinene. In this reaction α-Pinene (γ1) is thermally isomerized to dipentene (γ2) and allo-ocimene (γ3), which in turn yields α- and β-Pyronene (γ4) and a dimer (γ5).
Figure 6 Proposed mechanism describing the thermal isomerization of α-Pinene. In this reaction α-Pinene (γ1) is thermally isomerized to dipentene (γ2) and allo-ocimene (γ3), which in turn yields α- and β-Pyronene (γ4) and a dimer (γ5).CC BY · PubMed Central
Figure 7 Proposed mechanism describing the irreversible inhibition of HIV proteinase. The enzyme HIV proteinase (E), which is only active in a dimer form, was added to a solution of an irreversible inhibitor (I) and a fluorogenic substrate (S). The product (P) is a competitive inhibitor for the substrate.
Figure 7 Proposed mechanism describing the irreversible inhibition of HIV proteinase. The enzyme HIV proteinase (E), which is only active in a dimer form, was added to a solution of an irreversible inhibitor (I) and a fluorogenic substrate (S). The product (P) is a competitive inhibitor for the substrate.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 34 references

Research works printed but not linked: 2

  1. Cizniar M, Salhi D, Fikar M, Latifi M: A MATLAB package for orthogonal collocations on finite elements in dynamic optimisation. Proc 15 Int Conference Process Control, Volume 5 058f-058f.
  2. Hunter W, McGregor J: The estimation of common parameters from several responses: Some actual examples. Unpublished Report. 1967.

Cited by

See all 41

Metadata

Authors
Miró, A., Pozo, C., Guillén-Gosálbez, G., Egea, J. A., & Jiménez, L.
Affiliations
Universitat Rovira i Virgili (ES)
Venue
BMC Bioinformatics
Published
2012-05-10
Volume
13
Issue
1
Pages
90-90
ISSN
1471-2105 (ISSN-L)
OpenAlex
W2040571528
Cited by
41
References
34
Citations by year
2026: 1 · 2025: 5 · 2024: 1 · 2023: 4 · 2022: 4 · 2021: 2 · 2020: 2 · 2019: 3 · 2018: 3 · 2017: 5 · 2016: 2 · 2015: 2 · 2014: 2 · 2013: 5
FWCI
3.45
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • BMC Bioinformatics (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Rovira & Virgili repository (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • Repository for Publications and Research Data (ETH Zurich) (submittedVersion, cc-by)
  • ETH Zürich Research Collection (cc-by)
Funders
Ministerio de Ciencia e Innovación
Topics
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Engineering › Control and Systems Engineering › Process Optimization and Integration
Keywords
parameter estimation, deterministic global optimization, outer approximation, mixed-integer linear programming, nonconvex nonlinear programming, orthogonal collocation, ordinary differential equations, hierarchical decomposition, multiple local minima
MeSH terms
Bicyclic Monoterpenes, Algorithms, Computer Simulation, HIV, Humans, Isomerism, Models, Biological, HIV Protease, HIV Protease Inhibitors, Nonlinear Dynamics, Monoterpenes

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems. https://app.cochat.ai/papers/10.1186/1471-2105-13-90
The paper
Miró, A., Pozo, C., Guillén-Gosálbez, G., Egea, J. A., & Jiménez, L. (2012). Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-13-90

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.