Articles liés à Simplicial Global Optimization

9781461490920: Simplicial Global Optimization

Synopsis

Simplicial 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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l'auteur

Linas Stripinis received a Ph.D. degree in informatics from Vilnius University, Lithuania, in 2021. He is currently a researcher at Vilnius University. His research interests include global optimization, optimization software, parallel computing, and machine learning techniques.

Remigijus Paulavi¿ius received a Ph.D. degree in computer science from Vytautas Magnus University, Lithuania, in 2010. He was a Postdoctoral Researcher at Vilnius University, Lithuania, and a Research Associate at Imperial College London, UK. Since 2019, he has been a member of the Young Academy of the Lithuanian Academy of Sciences and a professor of informatics at the Institute of Data Science and Digital Technologies of Vilnius University. His research interests include global optimization, optimization software, parallel and quantum computing, and distributed ledger technologies.

À propos de la quatrième de couverture

Simplicial 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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.