LEADER 03136oam  2200469   450 
001 9910392739403321
005 20190911103512.0
010   $a1-4614-9093-6
024 7 $a10.1007/978-1-4614-9093-7
035   $a(OCoLC)862438303
035   $a(MiFhGG)GVRL6WHT
035   $a(EXLCZ)993710000000024991
100   $a20130903d2014      uy             0
101 0 $aeng
135   $aurun|---uuuua
181   $ctxt
182   $cc
183   $acr
200 10$aSimplicial global optimization /$fRemigijus Paulavicius, Julius Zilinskas
205   $a1st ed. 2014.
210  1$aNew York :$cSpringer,$d2014.
215   $a1 online resource (x, 137 pages) $cillustrations (chiefly color)
225 1 $aSpringerBriefs in Optimization,$x2190-8354
300   $a"ISSN: 2190-8354."
300   $a"ISSN: 2191-575X (electronic)."
311   $a1-4614-9092-8 
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.
606   $aMathematical optimization
615  0$aMathematical optimization.
676   $a511.5
676   $a519.6
700   $aPaulavi?ius$b Remigijus$4aut$4http://id.loc.gov/vocabulary/relators/aut$0721723
702   $aZilinskas$b J$g(Julius),$f1973-
801  0$bMiFhGG
801  1$bMiFhGG
906   $aBOOK
912   $a9910392739403321
996   $aSimplicial Global Optimization$92525171
997   $aUNINA