Accession Number : ADA308174
Title : Pattern Search Algorithms for Bound Constrained Minimization.
Descriptive Note : Contract rept.,
Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA
Personal Author(s) : Lewis, Robert M. ; Torczon, Virginia
PDF Url : ADA308174
Report Date : MAR 1996
Pagination or Media Count : 22
Abstract : We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexibility present in pattern search methods for unconstrained problems. We prove global convergence despite the fact that pattern search methods do not have explicit information concerning the gradient and its projection onto the feasible region and consequently are unable to enforce explicitly a notion of sufficient feasible decrease.
Descriptors : *ALGORITHMS, *OPTIMIZATION, MATRICES(MATHEMATICS), BOUNDARIES, CONVERGENCE, PATTERN RECOGNITION, NONLINEAR ANALYSIS, NONLINEAR PROGRAMMING.
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE