Abstract
We describe and critique the convergence properties of filter-based evolutionary pattern search algorithms (F-EPSAs). F-EPSAs implicitly use a filter to perform a multi-objective search for constrained problems such that convergence can be guaranteed. We provide two examples that illustrate how F-EPSAs may generate limit points other than constrained stationary points. F-EPSAs are evolutionary pattern search methods that employ a finite set of search directions, and our examples illustrate how the choice of search directions impacts an F-EPSA’s search dynamics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. Department of Computational and Applied Mathematics, Rice University, Houston, Texas, TR00-09 (2000)
Camponogara, E., Talukdar, S.N.: A genetic algorithm for constrained and multiobjective optimization. In: J.T. Alander, editor, 3rd Nordic Workshop on Genetic Algorithms and Their Applications, pp. 49–62 (1997)
Clarke, F.H.: Optimization and nonsmooth analysis. SIAM Classics in Applied Mathematics 5 (1990)
Clevenger, L., Ferguson, L., Hart, W.E.: A filter-based evolutionary algorithm for constrained optimization (submitted)
Coello Coello, C.A.: Constraint-handling using an evolutionary multiobjective optimization technique. Civil Engineering Systems, Gordon and Breach Science Publishers 17, 319–346 (2000)
Coello Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191(11-12), 1245–1287 (2002)
Deb, K.: An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186(2/4), 311–338 (2000)
Ferguson, L., Hart, W.E.: A filter-based evolutionary algorithm for constrained optimization (extended abstract). In: Proc Workshop on Foundations of Evolutionary Algorithms, pp. 287–290 (2003)
Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, P.L., Wächter, A.: Global convergence of trust-region SQP-filter algorithms for nonlinear programming. SIAM Journal on Optimization 13(3), 635–659 (2002)
Fletcher, R., Leyffer, S.: On the global convergence of a filter-SQP algorithm. SIAM Journal on Optimization 13(1), 44–59 (2002)
Hart, W.E.: Rethinking the design of real-coded evolutionary algorithms: Making discrete choices in continuous search domains. Soft Computing Journal (2003) (to appear)
Knowles, J.D., Corne, D., Approximating, W.: the nondominated front using the pareto archived evolution strategy. Evolutionary Computation 8(2), 149–172 (2000)
Smith, A.E., Coit, D.W.: Constraint handling techniques-penalty functions. In: Handbook of Evolutionary Computation, Oxford University Press and Institute of Physics Publishing (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clevenger, L.M., Hart, W.E. (2004). Convergence Examples of a Filter-Based Evolutionary Algorithm. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive