A new method for global optimization
By: by James K. Hartman
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1973
Place of publication: Monterey, California
Language: eng
Number of pages: 15
Subjects: Mathematical optimization; Nonlinear programming
Description: The basic descent algorithms for minimizing nonlinear objective functions will generally find a local minimum. For problems with multimodal objective functions, it is desirable to extend the search in an attempt to find a global minimum. Several versions of a new method for doing this are presented. Computational tests are performed to compare these methods with existing methods. (Author)
Notes: Title from cover.

"April 1973"--Cover.

"NPS-55HH73041A"--Cover.

DTIC Identifiers: Computation, global problems.

Author(s) key words: Nonlinear programming, mathematical programming, optimization, global optimization, search methods.

Includes bibliographical references (p. 12)

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1973.

kmc/kmc 9/11/09.