Get Free Shipping on orders over $79
Iterative Optimizers : Difficulty Measures and Benchmarks - Maurice Clerc

Iterative Optimizers

Difficulty Measures and Benchmarks

By: Maurice Clerc

eText | 10 April 2019 | Edition Number 1

At a Glance

eText


$260.69

or 4 interest-free payments of $65.17 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

More in Systems Analysis & Design

Quantum Computing - Alex Wood

eBOOK

Think Distributed Systems - Dominik Tornow

eBOOK

A I(M) Here to Stay - Jonathon Wetzel

eBOOK