Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Pattern search (optimization)
open-in-new
<p>Pattern search (also known as direct search, derivative-free search, or black-box search) is a family of numerical <a href="/facts/Optimization_(mathematics)/oRn8Iv5I">optimization</a> methods that does not require a <a href="/facts/Gradient/TsR7uukj">gradient</a>. As a result, it can be used on functions that are not <a href="/facts/Continuous_function/sKbl02pB">continuous</a> or <a href="/facts/Differentiable_function/jQqTgLk1">differentiable</a>. One such pattern search method is "convergence" (see below), which is based on the theory of positive bases. Optimization attempts to find the best match (the solution that has the lowest error value) in a <a href="/facts/Multidimensional_analysis/1epd7zfc">multidimensional analysis</a> space of possibilities. </p>