A New Method for Global Optimization,

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1973
Accession Number
AD0764543

Entities

People

  • James K. Hartman

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Heuristic Methods
  • Mathematics
  • Optimization

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Modeling and Simulation