Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.

Library

How to choose an Optimization Algorithm

Users: 2 - Average Rating: 4.50


Optimization is the problem of finding a set of inputs to an objective function that results in a maximum or minimum function evaluation. There are perhaps hundreds of popular optimization algorithms, and perhaps tens of algorithms to choose from in popular scientific code libraries. This can make it challenging to know which algorithms to consider for a given optimization problem.
In this tutorial, you will discover a guided tour of different optimization algorithms.
After completing this tutorial, you will know:
- Optimization algorithms may be grouped into those that use derivatives and those that do not.
- Classical algorithms use the first and sometimes second derivative of the objective function.
- Direct search and stochastic algorithms are designed for objective functions where function derivatives are unavailable.

Area:
Optimization


Cite as:
Brownlee, J., 2022. How to Choose an Optimization Algorithm. [online] Machine Learning Mastery. Available at: [Accessed 3 May 2022].

Author of the review:
Ana I. Pereira
Instituto Politécnico de Bragança


Reviews

You have to login to leave a comment. If you are not registered click here

Eligius Hendrix


For the developer of optimization algorithms, we should start turing around this question. How to find the nice optimization problem for my algorithm. However, the best question remains: for which type of instances does my algorithm work badly.