| 书目名称 | Simplicial Global Optimization |
| 编辑 | Remigijus Paulavičius,Julius Žilinskas |
| 视频video | |
| 概述 | Extends class of algorithms for Lipschitz global optimization without the Lipschitz constant.Contains a deep investigation of particular cases of simplicial partitions.Provides applications where simp |
| 丛书名称 | SpringerBriefs in Optimization |
| 图书封面 |  |
| 描述 | .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 partitio |
| 出版日期 | Book 2014 |
| 关键词 | Lipschitz optimization; Simplicial partitions; branch and bound; heuristic partitioning; nonlinear least |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4614-9093-7 |
| isbn_softcover | 978-1-4614-9092-0 |
| isbn_ebook | 978-1-4614-9093-7Series ISSN 2190-8354 Series E-ISSN 2191-575X |
| issn_series | 2190-8354 |
| copyright | Remigijus Paulavičius, Julius Žilinskas 2014 |
发表于 2025-3-21 16:33:16
