Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization
Journal Article
·
· IEEE Transactions on Evolutionary Computation
OSTI ID:756064
- Sandia National Laboratories
The authors describe a convergence theory for evolutionary pattern search algorithms (EPSAs) on a broad class of unconstrained and linearly constrained problems. EPSAs adaptively modify the step size of the mutation operator in response to the success of previous optimization steps. The design of EPSAs is inspired by recent analyses of pattern search methods. The analysis significantly extends the previous convergence theory for EPSAs. The analysis applies to a broader class of EPSAs,and it applies to problems that are nonsmooth, have unbounded objective functions, and which are linearly constrained. Further, they describe a modest change to the algorithmic framework of EPSAs for which a non-probabilistic convergence theory applies. These analyses are also noteworthy because they are considerably simpler than previous analyses of EPSAs.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- AC04-94AL85000;
- OSTI ID:
- 756064
- Report Number(s):
- SAND2000-1395J
- Journal Information:
- IEEE Transactions on Evolutionary Computation, Journal Name: IEEE Transactions on Evolutionary Computation
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search
Evolutionary pattern search algorithms
A generalized stationary point convergence theory for evolutionary algorithms
Journal Article
·
1999
· Evolutionary Computation
·
OSTI ID:5908
Evolutionary pattern search algorithms
Conference
·
1995
·
OSTI ID:244348
A generalized stationary point convergence theory for evolutionary algorithms
Conference
·
1997
·
OSTI ID:486145