Derivative-free optimization
Derivative-free optimization is a discipline in mathematical optimization that does not use derivative information in the classical sense to find optimal solutions: Sometimes information about the derivative of the objective function f is unavailable, unreliable or impractical to obtain. For example, f might be non-smooth, or time-consuming to evaluate, or in some way noisy, so that methods that rely on derivatives or approximate them via finite differences are of little use. The problem to find optimal points in such situations is referred to as derivative-free optimization, algorithms that do not use derivatives or finite differences are called derivative-free algorithms.
primaryTopic
Derivative-free optimization
Derivative-free optimization is a discipline in mathematical optimization that does not use derivative information in the classical sense to find optimal solutions: Sometimes information about the derivative of the objective function f is unavailable, unreliable or impractical to obtain. For example, f might be non-smooth, or time-consuming to evaluate, or in some way noisy, so that methods that rely on derivatives or approximate them via finite differences are of little use. The problem to find optimal points in such situations is referred to as derivative-free optimization, algorithms that do not use derivatives or finite differences are called derivative-free algorithms.
has abstract
Derivative-free optimization i ...... ed derivative-free algorithms.
@en
Wikipage page ID
41,680,875
page length (characters) of wiki page
Wikipage revision ID
1,013,009,757
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Derivative-free optimization i ...... ed derivative-free algorithms.
@en
label
Derivative-free optimization
@en