國立虎尾科技大學 |

The GLOBAL Optimization Algorithm = Newly Updated with Java Implementation and Parallelization /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	The GLOBAL Optimization Algorithm / by Balázs Bánhelyi, Tibor Csendes, Balázs Lévai, László Pál, Dániel Zombori.
Reminder of title:	Newly Updated with Java Implementation and Parallelization /
Author:	Bánhelyi, Balázs.
other author:	Csendes, Tibor.
Description:	IX, 111 p. 21 illus., 10 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Calculus of variations. -
Online resource:	https://doi.org/10.1007/978-3-030-02375-1
ISBN:	9783030023751

The GLOBAL Optimization Algorithm = Newly Updated with Java Implementation and Parallelization /
Bánhelyi, Balázs.

The GLOBAL Optimization Algorithm Newly Updated with Java Implementation and Parallelization /[electronic resource] :by Balázs Bánhelyi, Tibor Csendes, Balázs Lévai, László Pál, Dániel Zombori. - 1st ed. 2018. - IX, 111 p. 21 illus., 10 illus. in color.online resource. - SpringerBriefs in Optimization,2190-8354. - SpringerBriefs in Optimization,.

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.

ISBN: 9783030023751

Standard No.: 10.1007/978-3-030-02375-1doiSubjects--Topical Terms:

527927
Calculus of variations.

LC Class. No.: QA315-316

Dewey Class. No.: 515.64

The GLOBAL Optimization Algorithm = Newly Updated with Java Implementation and Parallelization /
LDR:02631nam a22004095i 4500 001 991532
003 DE-He213
005 20200702023531.0
007 cr nn 008mamaa
008 201225s2018 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
035 $a 978-3-030-02375-1
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 $3 1283206
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. $3 527927
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Operations research. $3 573517
650 0 $a Management science. $3 719678
650 0 $a Mathematical analysis. $3 527926
650 0 $a Analysis (Mathematics). $3 1253570
650 1 4 $a Calculus of Variations and Optimal Control; Optimization. $3 593942
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Analysis. $3 669490
700 1 $a Csendes, Tibor. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1283207
700 1 $a Lévai, Balázs. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1283208
700 1 $a Pál, László. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1283209
700 1 $a Zombori, Dániel. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1283210
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
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 $3 1254063
856 4 0 $u https://doi.org/10.1007/978-3-030-02375-1
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)