03671nam 22005775i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003100137041000800168050001600176072001700192072002300209072002300232082001200255100002700267245009400294260006100388264006100449300003400510336002600544337002600570338003600596347002400632490005700656505021000713520160000923650001702523650001602540650002402556650003902580650001602619650001702635650002402652650004902676650002502725650001602750650005102766700003502817710003402852773002002886776003602906830005702942856004402999912001403043912001403057942000703071999001503078978-3-540-46103-6DE-He21320141014114420.0cr nn 008mamaa121227s1989 gw | s |||| 0|eng d a97835404610369978-3-540-46103-67 a10.1007/3-540-50871-62doi aeng 4aQA297-299.4 7aPBKS2bicssc 7aMAT0210002bisacsh 7aMAT0060002bisacsh04a5182231 aTèorn, Aimo.eeditor.10aGlobal Optimizationh[electronic resource] /cedited by Aimo Tèorn, Antanas éZilinskas. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1989. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1989. aXII, 260 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v3500 aCovering methods -- Methods of generalized descent -- Random search methods -- Clustering methods -- Methods based on statistical models of objective functions -- Miscellaneous -- Testing and applications. aGlobal optimization is concerned with finding the global extremum (maximum or minimum) of a mathematically defined function (the objective function) in some region of interest. In many practical problems it is not known whether the objective function is unimodal in this region; in many cases it has proved to be multimodal. Unsophisticated use of local optimization techniques is normally inefficient for solving such problems. Therefore, more sophisticated methods designed for global optimization, i.e. global optimization methods, are important from a practical point of view. Most methods discussed here assume that the extremum is attained in the interior of the region of interest, i.e., that the problem is essentially unconstrained. Some methods address the general constrained problem. What is excluded is the treatment of methods designed for problems with a special structure, such as quadratic programming with negatively quadratic forms. This book is the first broad treatment of global optimization with an extensive bibliography covering research done both in east and west. Different ideas and methods proposed for global optimization are classified, described and discussed. The efficiency of algorithms is compared by using both artificial test problems and some practical problems. The solutions of two practical design problems are demonstrated and several other applications are referenced. The book aims at aiding in the education, at stimulating the research in the field, and at advising practitioners in using global optimization methods for solving practical problems. 0aMathematics. 0aAlgorithms. 0aNumerical analysis. 0aDistribution (Probability theory). 0aStatistics.14aMathematics.24aNumerical Analysis.24aProbability Theory and Stochastic Processes.24aStatistics, general.24aAlgorithms.24aSystems and Information Theory in Engineering.1 aéZilinskas, Antanas.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540508717 0aLecture Notes in Computer Science,x0302-9743 ;v35040uhttp://dx.doi.org/10.1007/3-540-50871-6 aZDB-2-SCS aZDB-2-LNC cEB c7213d7213