IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v85y2023i2d10.1007_s10589-023-00466-3.html
   My bibliography  Save this article

Branch-and-Model: a derivative-free global optimization algorithm

Author

Listed:
  • Kaiwen Ma

    (Carnegie Mellon University)

  • Luis Miguel Rios

    (End-to-End Analytics)

  • Atharv Bhosekar

    (GAMS Development Corporation)

  • Nikolaos V. Sahinidis

    (Georgia Institute of Technology)

  • Sreekanth Rajagopalan

    (The Dow Chemical Company)

Abstract

This paper presents a novel derivative-free global optimization algorithm Branch-and-Model (BAM). The BAM algorithm partitions the search domain dynamically, builds surrogate models around carefully selected evaluated points, and uses these models to exploit local function trends and speed up convergence. For model construction, BAM employs Automated Learning of Algebraic Models (ALAMO). The ALAMO algorithm generates algebraic models of the black-box function using various base functions and selection criteria. BAM’s potentially optimal identification scheme saves computational effort and prevents delays in searching for optimal solutions. The BAM algorithm is guaranteed to converge to the globally optimal function value under mild assumptions. Extensive computational experiments over 500 publicly open-source test problems and one industrially-relevant application show that BAM outperforms state-of-the-art DFO algorithms regardless of problem convexity and smoothness, especially for higher-dimensional problems.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:85:y:2023:i:2:d:10.1007_s10589-023-00466-3
    DOI: 10.1007/s10589-023-00466-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00466-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-023-00466-3?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.

    References listed on IDEAS

    as
    1. NESTEROV, Yurii, 2013. "Gradient methods for minimizing composite functions," LIDAM Reprints CORE 2510, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Rommel G. Regis & Christine A. Shoemaker, 2007. "A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 497-509, November.
    3. 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.
    4. 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.
    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. Jianyuan Zhai & Fani Boukouvala, 2022. "Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization," Journal of Global Optimization, Springer, vol. 82(1), pages 21-50, January.
    7. 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)

    Citations

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


    Cited by:

    1. 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.
    2. Mittal, Prateek & Christopoulos, Giorgos & Subramanian, Sriram, 2024. "Energy enhancement through noise minimization using acoustic metamaterials in a wind farm," Renewable Energy, Elsevier, vol. 224(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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury, 2021. "Decomposition in derivative-free optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 269-292, October.
    6. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
    7. Juliane Müller, 2017. "SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective Problems," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 581-596, November.
    8. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
    9. Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
    10. Songhao Wang & Szu Hui Ng & William Benjamin Haskell, 2022. "A Multilevel Simulation Optimization Approach for Quantile Functions," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 569-585, January.
    11. Zhaosong Lu & Xiaojun Chen, 2018. "Generalized Conjugate Gradient Methods for ℓ 1 Regularized Convex Quadratic Programming with Finite Convergence," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 275-303, February.
    12. Juliane Müller & Christine Shoemaker & Robert Piché, 2014. "SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications," Journal of Global Optimization, Springer, vol. 59(4), pages 865-889, August.
    13. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    14. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. 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.
    16. Masoud Ahookhosh, 2019. "Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 319-353, June.
    17. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    18. Dewei Zhang & Yin Liu & Sam Davanloo Tajbakhsh, 2022. "A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1126-1140, March.
    19. Weibin Mo & Yufeng Liu, 2022. "Efficient learning of optimal individualized treatment rules for heteroscedastic or misspecified treatment‐free effect models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 440-472, April.
    20. Liu, Yulan & Bi, Shujun, 2019. "Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 418-435.

    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:spr:coopap:v:85:y:2023:i:2:d:10.1007_s10589-023-00466-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.