Simplicial Global Optimization [electronic resource] / by Remigijus Paulavičius, Julius Žilinskas.

By: Paulavičius, Remigijus [author.]
Contributor(s): Žilinskas, Julius [author.] | SpringerLink (Online service)
Material type: TextTextSeries: SpringerBriefs in Optimization: Publisher: New York, NY : Springer New York : Imprint: Springer, 2014Description: X, 137 p. 51 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9781461490937Subject(s): Mathematics | Applied mathematics | Engineering mathematics | Operations research | Management science | Combinatorics | Mathematics | Operations Research, Management Science | Combinatorics | Applications of MathematicsAdditional physical formats: Printed edition:: No titleDDC classification: 519.6 LOC classification: QA402-402.37T57.6-57.97Online resources: Click here to access online
Contents:
1. 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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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

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.

There are no comments for this item.

to post a comment.

Powered by Koha