|
|
|
|
| LEADER |
03859nam a2200601 4500 |
| 001 |
978-3-030-02375-1 |
| 003 |
DE-He213 |
| 005 |
20191027081038.0 |
| 007 |
cr nn 008mamaa |
| 008 |
181210s2018 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783030023751
|9 978-3-030-02375-1
|
| 024 |
7 |
|
|a 10.1007/978-3-030-02375-1
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA315-316
|
| 050 |
|
4 |
|a QA402.3
|
| 072 |
|
7 |
|a PBKQ
|2 bicssc
|
| 072 |
|
7 |
|a MAT005000
|2 bisacsh
|
| 072 |
|
7 |
|a PBKQ
|2 thema
|
| 072 |
|
7 |
|a PBU
|2 thema
|
| 082 |
0 |
4 |
|a 515.64
|2 23
|
| 100 |
1 |
|
|a Bánhelyi, Balázs.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
4 |
|a The GLOBAL Optimization Algorithm
|h [electronic resource] :
|b Newly Updated with Java Implementation and Parallelization /
|c by Balázs Bánhelyi, Tibor Csendes, Balázs Lévai, László Pál, Dániel Zombori.
|
| 250 |
|
|
|a 1st ed. 2018.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2018.
|
| 300 |
|
|
|a IX, 111 p. 21 illus., 10 illus. in color.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a SpringerBriefs in Optimization,
|x 2190-8354
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Calculus of variations.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Operations research.
|
| 650 |
|
0 |
|a Management science.
|
| 650 |
|
0 |
|a Mathematical analysis.
|
| 650 |
|
0 |
|a Analysis (Mathematics).
|
| 650 |
1 |
4 |
|a Calculus of Variations and Optimal Control; Optimization.
|0 http://scigraph.springernature.com/things/product-market-codes/M26016
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|0 http://scigraph.springernature.com/things/product-market-codes/I17001
|
| 650 |
2 |
4 |
|a Operations Research, Management Science.
|0 http://scigraph.springernature.com/things/product-market-codes/M26024
|
| 650 |
2 |
4 |
|a Analysis.
|0 http://scigraph.springernature.com/things/product-market-codes/M12007
|
| 700 |
1 |
|
|a Csendes, Tibor.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Lévai, Balázs.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Pál, László.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Zombori, Dániel.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783030023744
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783030023768
|
| 830 |
|
0 |
|a SpringerBriefs in Optimization,
|x 2190-8354
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-030-02375-1
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
