Pattern search for optimization

Nicholas V. Findler, Cher Lo and Ron Lo

Mathematics and Computers in Simulation (MATCOM), 1987, vol. 29, issue 1, 41-50

Abstract: We describe a relatively inexpensive but rather effective version of pattern search technique to optimize multi-dimensional, implicitly specified, non-smooth functions (those with ridges, plateaus, discontinuities). It is based on the heuristic of repeating the best search direction found in exploratory moves as long as the response function improves. We also deal with the problem of generating adequately dispersed and an apropriate number of starting points to overcome noise and the danger of getting trapped in local optima.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475487900656
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:29:y:1987:i:1:p:41-50

DOI: 10.1016/0378-4754(87)90065-6

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().