Multimodal search techniques, 1971

Item — Multiple Containers

Identifier: b2087702

Staff Only

Scope and Contents

From the Collection:

The collection consists of theses written by students enrolled in the Monmouth College and Monmouth University graduate Electronic Engineering programs. The holdings are bound print documents that were submitted in partial fulfillment of requirements for the Master of Science degree.

Dates

Creation: 1971

Creator

Major, Paul A. (Author, Person)
Drucker, Harris (1943-2024) (Thesis advisor, Person)

Conditions Governing Access

All analog collection holdings are limited to library use only.

Researchers seeking to photocopy collection materials must complete an Application to Photocopy Form.

In some cases, photocopying of collection materials may be performed by the Monmouth University Library staff.

The Monmouth University Library reserves the right to limit or refuse duplication requests subject to the condition of collection materials and/or restrictions imposed by the collection creators or by the United States Copyright Act.

Permission to examine, or copy, collection materials does not imply permission to publish or quote. It is the responsibility of the researcher to obtain such permissions from both the copyright holder and Monmouth University.

Extent

2 Items (print book) : 89 pages ; 8.5 x 11.0 inches (28 cm).

Language of Materials

English

Additional Description

Abstract

The purpose of this paper is to investigate the suitability of dynamic simplex search methods for finding the global extremum of multimodal functions. The search will be in N variable space with the form of the function unknown or in such a form that conventional techniques such as the calculus cannot be used.

The initial search is conducted using the dynamic simplex method to find the first extremum. Three methods were evaluated for their usefulness in determining the global extremum. The first of these is the dyanamic simplex with a randomly selected new starting point. The next method is a continued dynamic simplex, where the extremum will be used as the starting point for a new simplex. The third method is a steepest-slope dynamic simplex combination. In all cases, subsequent searches are excluded from re-entering the area of previously searched regions. The variable structure automaton multimodal search technique is used for comparison with the above three methods. The multi-trig function is used as the test function.

The adequacy of each of the methods is evaluated for the finding of the global extremum in the least number of iterations. The results show that the randomly selected new start point method will best meet this requirement.

Partial Contents

Abstract -- Introduction -- Discussion -- Search techniques -- Results -- Conclusions -- Appendix I -- Appendix II -- Appendix III -- Appendix IV -- Appendix V -- Appendix VI -- References.