IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v217y2024icp311-326.html
   My bibliography  Save this article

A Branch and Bound algorithm for multidimensional Holder optimization: Estimation of the age-dependent viral hepatitis A infection force

Author

Listed:
  • Naffeti, Bechir
  • Ammar, Hamadi
  • Aribi, Walid Ben

Abstract

In the present framework, we develop a branch and bound multidimensional Holder optimization method. This method is composed of two subroutines. The first one allows converting the multivariate objective function into a single variable one using the alpha-dense space fitting curves. In the second subroutine, we minimize the single variable function resulting from the first subroutine. To achieve this task, we develop a novel iterative optimization method reducing the feasible region in each iteration taking into account the property of Holder of the objective function. We apply this method to solve a parameters identification problem resulting from the modelling of the spread of viral hepatitis A in the central west of Tunisia following the increase in the number of infections. The Tunisian health authorities wanted to know the prevalence and the infection force of the virus in order to identify the situation and take the necessary measures. The modelling leads to a minimization problem of the least square multivariate error between the observed values and the theoretical ones. Besides, we implement the proposed method in some numerical experiments to evaluate its efficiency.

Suggested Citation

  • Naffeti, Bechir & Ammar, Hamadi & Aribi, Walid Ben, 2024. "A Branch and Bound algorithm for multidimensional Holder optimization: Estimation of the age-dependent viral hepatitis A infection force," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 217(C), pages 311-326.
    • Handle: RePEc:eee:matcom:v:217:y:2024:i:c:p:311-326
    DOI: 10.1016/j.matcom.2023.10.024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475423004597
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2023.10.024?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:matcom:v:217:y:2024:i:c:p:311-326. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.