Skip to main content

The GLOBAL Optimization Algorithm

Newly Updated with Java Implementation and Parallelization

  • Book
  • © 2018

Overview

  • Contains a detailed manual to assist with modules and test functions
  • Features new updates for a local search algorithm
  • Presents an efficiency comparison to earlier implementations

Part of the book series: SpringerBriefs in Optimization (BRIEFSOPTI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

Keywords

About this book

This book explores the updated version of the GLOBAL algorithm which contains improvements for a local search algorithm and new Java implementations. Efficiency comparisons to earlier versions and on the increased speed achieved by the parallelization, are detailed. Examples are provided for students as well as researchers and practitioners in optimization, operations research, and mathematics to compose their own scripts with ease. A GLOBAL manual is presented in the appendix to assist new users with modules and test functions.  
GLOBAL is a successful stochastic multistart global optimization algorithm that has passed several computational tests, and is efficient and reliable for small to medium dimensional global optimization problems. The algorithm uses clustering to ensure efficiency and is modular in regard to the two local search methods it starts with, but it can also easily apply other local techniques. The strength of this algorithm lies in its reliability and adaptive algorithm parameters. The GLOBAL algorithm is free to download also in the earlier Fortran, C, and MATLAB implementations.

Authors and Affiliations

  • Department of Computational Optimization, University of Szeged, Szeged, Hungary

    Balázs Bánhelyi, Tibor Csendes, Dániel Zombori

  • NNG Inc, Szeged, Hungary

    Balázs Lévai

  • Sapientia Hungarian University of Transylvania, Miercurea Ciuc, Romania

    László Pál

About the authors

 

Bibliographic Information

Publish with us