A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search

Evolutionary Computation (2001) 9 (1): 1–23.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems

Majid Jaberipour
Esmaile Khorram
Behrooz Karimi

Optimization Methods and Software (2015) 30 (5): 911.

Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective

Natalio Krasnogor
Jim Smith

Journal of Mathematical Modelling and Algorithms (2008) 7 (1): 3.

Ant colony pattern search algorithms for unconstrained and bound constrained optimization

Y.J. Feng
L. Yu
G.L. Zhang

Applied Mathematics and Computation (2007) 191 (1): 42.

A derivative-free algorithm for unconstrained optimization

Peng Yehui
Liu Zhenhai

Applied Mathematics-A Journal of Chinese Universities (2005) 20 (4): 491.

Real-Coded Memetic Algorithms with Crossover Hill-Climbing

Manuel Lozano
Francisco Herrera
Natalio Krasnogor
Daniel Molina

Evolutionary Computation (2004) 12 (3): 273.

Locally-Adaptive and Memetic Evolutionary Pattern Search Algorithms

William E. Hart

Evolutionary Computation (2003) 11 (1): 29.

Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling

Yew S. Ong
Prasanth B. Nair
Andrew J. Keane

AIAA Journal (2003) 41 (4): 687.

Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Genetic Algorithm

Rajeev Kumar
Peter Rockett

Evolutionary Computation (2002) 10 (3): 283.

Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization

W.E. Hart

IEEE Transactions on Evolutionary Computation (2001) 5 (4): 388.