IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i2p283-d1319616.html
   My bibliography  Save this article

A Novel Approach to Enhance DIRECT -Type Algorithms for Hyper-Rectangle Identification

Author

Listed:
  • Nazih-Eddine Belkacem

    (Department of Mathematics, Faculty of Sciences, Ferhat-Abbas University of Sétif 1, Sétif 19000, Algeria)

  • Lakhdar Chiter

    (Department of Mathematics, Faculty of Sciences, Ferhat-Abbas University of Sétif 1, Sétif 19000, Algeria
    Fundamental and Numerical Mathematics Laboratory (LMFN), Ferhat-Abbas University, Sétif 19000, Algeria)

  • Mohammed Louaked

    (Laboratoire de Mathématiques Nicolas Oresme, Université de Caen, Campus II, Boulevard Maréchal Juin, B.P. 5186, 14032 Caen, France)

Abstract

This paper introduces novel enhancements to the most recent versions of DIRECT-type algorithms, especially when dealing with solutions located at the hyper-rectangle vertices. The BIRECT algorithm encounters difficulties in efficiently sampling points at the boundaries of the feasible region, leading to potential slowdowns in convergence. This issue is particularly pronounced when the optimal solution resides near the boundary. Our research explores diverse approaches, with a primary focus on incorporating a grouping strategy for hyper-rectangles of similar sizes. This categorization into different classes, constrained by a predefined threshold, aims to enhance computational efficiency, particularly involving a substantial number of hyper-rectangles of varying sizes. To further improve the new algorithm’s efficiency, we implemented a mechanism to prevent oversampling and mitigate redundancy in sampling at shared vertices within descendant sub-regions. Comparisons with several DIRECT-type algorithms highlight the promising nature of the proposed algorithms as a global optimization solution. Statistical analyses, including Friedman and Wilcoxon tests, demonstrated the effectiveness of the improvements introduced in this new algorithm.

Suggested Citation

  • Nazih-Eddine Belkacem & Lakhdar Chiter & Mohammed Louaked, 2024. "A Novel Approach to Enhance DIRECT -Type Algorithms for Hyper-Rectangle Identification," Mathematics, MDPI, vol. 12(2), pages 1-24, January.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:2:p:283-:d:1319616
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/2/283/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/2/283/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Donald R. Jones & Joaquim R. R. A. Martins, 2021. "The DIRECT algorithm: 25 years Later," Journal of Global Optimization, Springer, vol. 79(3), pages 521-566, March.
    2. Linas Stripinis & Remigijus Paulavičius, 2023. "Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    3. G. Liuzzi & S. Lucidi & V. Piccialli, 2016. "Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 449-475, November.
    4. Remigijus Paulavičius & Julius Žilinskas, 2014. "Simplicial Lipschitz optimization without the Lipschitz constant," Journal of Global Optimization, Springer, vol. 59(1), pages 23-40, May.
    5. Qunfeng Liu & Jinping Zeng & Gang Yang, 2015. "MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems," Journal of Global Optimization, Springer, vol. 62(2), pages 205-227, June.
    6. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    7. Kaiwen Ma & Luis Miguel Rios & Atharv Bhosekar & Nikolaos V. Sahinidis & Sreekanth Rajagopalan, 2023. "Branch-and-Model: a derivative-free global optimization algorithm," Computational Optimization and Applications, Springer, vol. 85(2), pages 337-367, June.
    8. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    9. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    Full references (including those not matched with items on IDEAS)

    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. Linas Stripinis & Remigijus Paulavičius, 2023. "Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    2. Donald R. Jones & Joaquim R. R. A. Martins, 2021. "The DIRECT algorithm: 25 years Later," Journal of Global Optimization, Springer, vol. 79(3), pages 521-566, March.
    3. Stripinis, Linas & Žilinskas, Julius & Casado, Leocadio G. & Paulavičius, Remigijus, 2021. "On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    4. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    5. Albertas Gimbutas & Antanas Žilinskas, 2018. "An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section," Journal of Global Optimization, Springer, vol. 71(1), pages 115-127, May.
    6. Kaiwen Ma & Luis Miguel Rios & Atharv Bhosekar & Nikolaos V. Sahinidis & Sreekanth Rajagopalan, 2023. "Branch-and-Model: a derivative-free global optimization algorithm," Computational Optimization and Applications, Springer, vol. 85(2), pages 337-367, June.
    7. M. Fernanda P. Costa & Ana Maria A. C. Rocha & Edite M. G. P. Fernandes, 2018. "Filter-based DIRECT method for constrained global optimization," Journal of Global Optimization, Springer, vol. 71(3), pages 517-536, July.
    8. G. Liuzzi & S. Lucidi & V. Piccialli, 2016. "Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 449-475, November.
    9. E. F. Campana & M. Diez & G. Liuzzi & S. Lucidi & R. Pellegrini & V. Piccialli & F. Rinaldi & A. Serani, 2018. "A multi-objective DIRECT algorithm for ship hull optimization," Computational Optimization and Applications, Springer, vol. 71(1), pages 53-72, September.
    10. Jonas Mockus & Remigijus Paulavičius & Dainius Rusakevičius & Dmitrij Šešok & Julius Žilinskas, 2017. "Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization," Journal of Global Optimization, Springer, vol. 67(1), pages 425-450, January.
    11. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    12. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    13. Qunfeng Liu & Guang Yang & Zhongzhi Zhang & Jinping Zeng, 2017. "Improving the convergence rate of the DIRECT global optimization algorithm," Journal of Global Optimization, Springer, vol. 67(4), pages 851-872, April.
    14. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    15. Linas Stripinis & Remigijus Paulavičius, 2022. "Experimental Study of Excessive Local Refinement Reduction Techniques for Global Optimization DIRECT-Type Algorithms," Mathematics, MDPI, vol. 10(20), pages 1-18, October.
    16. James Calvin & Gražina Gimbutienė & William O. Phillips & Antanas Žilinskas, 2018. "On convergence rate of a rectangular partition based global optimization algorithm," Journal of Global Optimization, Springer, vol. 71(1), pages 165-191, May.
    17. Stefan C. Endres & Carl Sandrock & Walter W. Focke, 2018. "A simplicial homology algorithm for Lipschitz optimisation," Journal of Global Optimization, Springer, vol. 72(2), pages 181-217, October.
    18. Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2018. "Metaheuristic vs. deterministic global optimization algorithms: The univariate case," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 245-259.
    19. Kristian Sabo & Rudolf Scitovski & Šime Ungar & Zoran Tomljanović, 2024. "A method for searching for a globally optimal k-partition of higher-dimensional datasets," Journal of Global Optimization, Springer, vol. 89(3), pages 633-653, July.
    20. Sergeyev, Yaroslav D. & Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2017. "Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 141(C), pages 96-109.

    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:gam:jmathe:v:12:y:2024:i:2:p:283-:d:1319616. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.