journal article
On the crude multidimensional search
Abstract
AbstractMultivariable trial functions that depend on random parameters are maximized by crude global search. Analytical and numerical investigations of error distributions confirm recent conclusions that in practice random searching points perform better than rectangular lattices, and that quasi-random searching points are even more efficientSimilar works
Full text
Last time updated on 05/05/2017
This paper was published in Elsevier - Publisher Connector .
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.