Unconstrained derivative-free optimizati
β
ΓrpΓ‘d BΕ±rmen; Tadej Tuma
π
Article
π
2009
π
Elsevier Science
π
English
β 912 KB
We present an algorithmic framework for unconstrained derivative-free optimization based on dividing the search space in regions (partitions). Every partition is assigned a representative point. The representative points form a grid. A piecewiseconstant approximation to the function subject to optim