LEADER 03858nam 22006855 450 001 9910392739403321 005 20251113183118.0 010 $a9781461490937 010 $a1461490936 024 7 $a10.1007/978-1-4614-9093-7 035 $a(OCoLC)862438303 035 $a(MiFhGG)GVRL6WHT 035 $a(CKB)3710000000024991 035 $a(MiAaPQ)EBC1538940 035 $a(MiFhGG)9781461490937 035 $a(DE-He213)978-1-4614-9093-7 035 $a(EXLCZ)993710000000024991 100 $a20131008d2014 u| 0 101 0 $aeng 135 $aurun|---uuuua 181 $ctxt 182 $cc 183 $acr 200 10$aSimplicial Global Optimization /$fby Remigijus Paulavi?ius, Julius ?ilinskas 205 $a1st ed. 2014. 210 1$aNew York, NY :$cSpringer New York :$cImprint: Springer,$d2014. 215 $a1 online resource (x, 137 pages) $cillustrations (chiefly color) 225 1 $aSpringerBriefs in Optimization,$x2191-575X 300 $a"ISSN: 2190-8354." 300 $a"ISSN: 2191-575X (electronic)." 311 08$a9781461490920 311 08$a1461490928 320 $aIncludes bibliographical references. 327 $a1. Simplicial Partitions in Global Optimization -- 2. Lipschitz Optimization with Different Bounds over Simplices -- 3. Simplicial Lipschitz Optimization without Lipschitz Constant -- 4. Applications of Global Optimization Benefiting from Simplicial Partitions -- References.-Description of Test Problems. 330 $aSimplicial Global Optimization is centered on deterministic covering methods partitioning feasible region by simplices. This book looks into the advantages of simplicial partitioning in global optimization through applications where the search space may be significantly reduced while taking into account symmetries of the objective function by setting linear inequality constraints that are managed by initial partitioning. The authors provide an extensive experimental investigation and illustrates the impact of various bounds, types of subdivision, strategies of candidate selection on the performance of algorithms. A comparison of various Lipschitz bounds over simplices and an extension of Lipschitz global optimization with-out the Lipschitz constant to the case of simplicial partitioning is also depicted in this text. Applications benefiting from simplicial partitioning are examined in detail such as nonlinear least squares regression and pile placement optimization in grillage-type foundations. Researchers and engineers will benefit from simplicial partitioning algorithms such as Lipschitz branch and bound, Lipschitz optimization without the Lipschitz constant, heuristic partitioning presented. This book will leave readers inspired to develop simplicial versions of other algorithms for global optimization and even use other non-rectangular partitions for special applications. 410 0$aSpringerBriefs in Optimization,$x2191-575X 606 $aOperations research 606 $aManagement science 606 $aDiscrete mathematics 606 $aMathematics 606 $aOperations Research, Management Science 606 $aDiscrete Mathematics 606 $aApplications of Mathematics 615 0$aOperations research. 615 0$aManagement science. 615 0$aDiscrete mathematics. 615 0$aMathematics. 615 14$aOperations Research, Management Science. 615 24$aDiscrete Mathematics. 615 24$aApplications of Mathematics. 676 $a511.5 676 $a519.6 700 $aPaulavic?ius$b Remigijus$4aut$4http://id.loc.gov/vocabulary/relators/aut$00 702 $aZ?ilinskas$b J$g(Julius),$f1973- 801 0$bMiFhGG 801 1$bMiFhGG 906 $aBOOK 912 $a9910392739403321 996 $aSimplicial Global Optimization$92525171 997 $aUNINA