IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v316y2024i1p36-45.html
   My bibliography  Save this article

A branch-and-bound algorithm with growing datasets for large-scale parameter estimation

Author

Listed:
  • Sass, Susanne
  • Mitsos, Alexander
  • Bongartz, Dominik
  • Bell, Ian H.
  • Nikolov, Nikolay I.
  • Tsoukalas, Angelos

Abstract

The solution of nonconvex parameter estimation problems with deterministic global optimization methods is desirable but challenging, especially if large measurement datasets are considered. We propose to exploit the structure of this class of optimization problems to enable their solution with the spatial branch-and-bound algorithm. In detail, we start with a reduced dataset in the root node and progressively augment it, converging to the full dataset. We show for nonlinear programs (NLPs) that our algorithm converges to the global solution of the original problem considering the full dataset. The implementation of the algorithm extends our open-source solver MAiNGO. A numerical case study with a mixed-integer nonlinear program (MINLP) from chemical engineering and a dynamic optimization problem from biochemistry both using noise-free measurement data emphasizes the potential for savings of computational effort with our proposed approach.

Suggested Citation

  • Sass, Susanne & Mitsos, Alexander & Bongartz, Dominik & Bell, Ian H. & Nikolov, Nikolay I. & Tsoukalas, Angelos, 2024. "A branch-and-bound algorithm with growing datasets for large-scale parameter estimation," European Journal of Operational Research, Elsevier, vol. 316(1), pages 36-45.
    • Handle: RePEc:eee:ejores:v:316:y:2024:i:1:p:36-45
    DOI: 10.1016/j.ejor.2024.02.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724001280
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.02.020?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:ejores:v:316:y:2024:i:1:p:36-45. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.