IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v59y2014i2p545-567.html
   My bibliography  Save this article

Globally-biased Disimpl algorithm for expensive global optimization

Author

Listed:
  • Remigijus Paulavičius
  • Yaroslav Sergeyev
  • Dmitri Kvasov
  • Julius Žilinskas

Abstract

Direct-type global optimization algorithms often spend an excessive number of function evaluations on problems with many local optima exploring suboptimal local minima, thereby delaying discovery of the global minimum. In this paper, a globally-biased simplicial partition Disimpl algorithm for global optimization of expensive Lipschitz continuous functions with an unknown Lipschitz constant is proposed. A scheme for an adaptive balancing of local and global information during the search is introduced, implemented, experimentally investigated, and compared with the well-known Direct and Direct l methods. Extensive numerical experiments executed on 800 multidimensional multiextremal test functions show a promising performance of the new acceleration technique with respect to competitors. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:59:y:2014:i:2:p:545-567
    DOI: 10.1007/s10898-014-0180-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-014-0180-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-014-0180-4?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. Ratko Grbić & Emmanuel Nyarko & Rudolf Scitovski, 2013. "A modification of the DIRECT method for Lipschitz global optimization for a symmetric function," Journal of Global Optimization, Springer, vol. 57(4), pages 1193-1212, December.
    2. Qunfeng Liu, 2013. "Linear scaling and the DIRECT algorithm," Journal of Global Optimization, Springer, vol. 56(3), pages 1233-1245, July.
    3. L. Casado & I. García & B. Tóth & E. Hendrix, 2011. "On determining the cover of a simplex by spheres centered at its vertices," Journal of Global Optimization, Springer, vol. 50(4), pages 645-655, August.
    4. Antanas Žilinskas & Julius Žilinskas, 2013. "A hybrid global optimization algorithm for non-linear least squares regression," Journal of Global Optimization, Springer, vol. 56(2), pages 265-277, June.
    5. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    6. YA. D. Sergeyev, 2000. "Efficient Strategy for Adaptive Partition of N-Dimensional Intervals in the Framework of Diagonal Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 107(1), pages 145-168, October.
    7. A. Custódio & H. Rocha & L. Vicente, 2010. "Incorporating minimum Frobenius norm models in direct search," Computational Optimization and Applications, Springer, vol. 46(2), pages 265-278, June.
    8. 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.
    9. D. Serafino & G. Liuzzi & V. Piccialli & F. Riccio & G. Toraldo, 2011. "A Modified DIviding RECTangles Algorithm for a Problem in Astrophysics," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 175-190, October.
    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. 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.
    2. 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.
    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. 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. Rudolf Scitovski, 2017. "A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set," Journal of Global Optimization, Springer, vol. 68(4), pages 713-727, August.
    6. 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.
    7. 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.
    8. Ratko Grbić & Emmanuel Nyarko & Rudolf Scitovski, 2013. "A modification of the DIRECT method for Lipschitz global optimization for a symmetric function," Journal of Global Optimization, Springer, vol. 57(4), pages 1193-1212, December.
    9. Christopher M. Cotnoir & Balša Terzić, 2017. "Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization," Journal of Global Optimization, Springer, vol. 68(3), pages 663-675, July.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Antanas Žilinskas & James Calvin, 2019. "Bi-objective decision making in global optimization based on statistical models," Journal of Global Optimization, Springer, vol. 74(4), pages 599-609, August.
    15. Andrey Pepelyshev & Anatoly Zhigljavsky & Antanas Žilinskas, 2018. "Performance of global random search algorithms for large dimensions," Journal of Global Optimization, Springer, vol. 71(1), pages 57-71, May.
    16. Usama Khaled & Ali M. Eltamaly & Abderrahmane Beroual, 2017. "Optimal Power Flow Using Particle Swarm Optimization of Renewable Hybrid Distributed Generation," Energies, MDPI, vol. 10(7), pages 1-14, July.
    17. Vasiliy V. Grigoriev & Petr N. Vabishchevich, 2021. "Bayesian Estimation of Adsorption and Desorption Parameters for Pore Scale Transport," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    18. 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.
    19. Qunfeng Liu & Jinping Zeng, 2015. "Global optimization by multilevel partition," Journal of Global Optimization, Springer, vol. 61(1), pages 47-69, January.
    20. Jonathan Gillard & Anatoly Zhigljavsky, 2013. "Optimization challenges in the structured low rank approximation problem," Journal of Global Optimization, Springer, vol. 57(3), pages 733-751, November.

    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:jglopt:v:59:y:2014:i:2:p:545-567. 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.