Why Pattern Search Works

Abstract

Pattern search methods are a class of direct search methods for nonlinear optimization. Since the introduction of the original pattern search methods in the late 1950s and early 1960s, they have remained popular with users due to their simplicity and the fact that they work well in practice on a variety of problems. More recently, the fact that they are provably convergent has generated renewed interest in the nonlinear programming community. The purpose of this article is to describe what pattern search methods are and why they work.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1998
Accession Number
ADA359194

Entities

People

  • Michael W. Trosset
  • Robert M. Lewis
  • Virginia Torczon

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Convergence
  • Engineering
  • Grids
  • Iterations
  • Linear Programming
  • Mathematics
  • Nonlinear Programming
  • Numbers
  • Optimization
  • Pathology
  • Sequences
  • Simplex Method
  • Stationary
  • Test And Evaluation

Readers

  • Operations Research
  • Systems Analysis and Design
  • Theoretical Analysis.