Jump to content

MCS algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 23:32, 5 September 2005 (formatting). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (Learn how and when to remove this message)

Multilevel Coordinate Search (MSC) is an algorithm for bound constrained global optimization using function values only.

External links

Homepage of the algorithm

[1] Presents the number of function-evaluations performed on the testset of Dixon-Szegö. Along with the MCS_algorithm, the BRST_algorithm requires the lowest number of evaluations.

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=MCS_algorithm&oldid=22655995"

Hidden categories: