Iterative Optimizers

Difficulty Measures and Benchmarks

By Maurice Clerc | Publisher: Wiley

About the book

Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life.

This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties.

The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.

Editions of Iterative Optimizers

Hardcover
ISBN 9781786304094
EBook
ISBN 9781119612360
EBook
ISBN 9781119612407
EBook
ISBN 9781119612476

Read an Excerpt

Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life.

This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties.

The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.

Frequently Asked Questions

What is Iterative Optimizers about?

Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life.

This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties.

The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.

What core themes, tropes, or subjects are explored in Iterative Optimizers?

Computing and Information Technology > Computer science

Where can I read a sample of Iterative Optimizers?

You can read an official preview of the few pages here https://www.book2look.com/book/9781786304094

Who is/are the Author/s of the book Iterative Optimizers?

Maurice Clerc

Who is the Publisher of the book Iterative Optimizers?

Wiley

What are the ISBN numbers for the physical and digital editions?

Iterative Optimizers is available as hardcover(ISBN 9781786304094) and ebook(ISBN 9781119612360) and ebook(ISBN 9781119612407) and ebook(ISBN 9781119612476)

Where can I buy Iterative Optimizers online or support local independent bookshops?

You can buy Iterative Optimizers from below

Where can I buy Iterative Optimizers?