---
title: Random optimization
slug: random-optimization
qid: 
snapshot: enwiki-001328888463
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1328888463
tags: [23118434, 23603337, 23617828]
---

# Random optimization

> [!note] Provenance
> Snapshot `enwiki-001328888463` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1328888463> · Licensed CC BY-SA 4.0

Random optimization (RO) is a family of numerical optimization methods that do not require the gradient of the optimization problem and RO can hence be used on functions that are not continuous or differentiable. Such optimization methods are also known as direct-search, derivative-free, or black-box methods. The name random optimization is attributed to Matyas who made an early presentation of RO along with basic mathematical analysis. RO works by iteratively moving to better positions in the search-space which are sampled using e.g. a normal distribution surrounding the current position.

Random optimization (RO) is a family of numerical optimization methods that do not require the gradient of the optimization problem and RO can hence be used on functions that are not continuous or differentiable. Such optimization methods are also known as direct-search, derivative-free, or black-box methods. The name random optimization is attributed to Matyas who made an early presentation of RO along with basic mathematical analysis. RO works by iteratively moving to better positions in the search-space which are sampled using e.g. a normal distribution surrounding the current position. If (f(y)&nbsp;<&nbsp;f(x)) then move to the new position by setting x&nbsp;=&nbsp;y Now x holds the best-found position. This algorithm corresponds to a (1+1) evolution strategy with constant step-size.
