We present and analyze a class of evolutionary algorithms for unconstrained and bound constrained optimization on R-n evolutionary pattern search algorithms (EPSAs). EPSAs adaptively modify the step size of the mutati...
详细信息
We present and analyze a class of evolutionary algorithms for unconstrained and bound constrained optimization on R-n evolutionary pattern search algorithms (EPSAs). 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 patternsearch methods. We show that EPSAs can be cast as stochastic patternsearch methods, and we use this observation to prove that EPSAs have a probabilistic, weak stationary point convergence theory. This convergence theory is distinguished by the fact that the analysis does not approximate the stochastic process of EPSAs, and hence it exactly characterizes their convergence properties.
We introduce a filter-based evolutionary algorithm (FEA) for constrained optimization. The filter used by an FEA explicitly imposes the concept of dominance on a partially ordered solution set. We show that the algori...
详细信息
We introduce a filter-based evolutionary algorithm (FEA) for constrained optimization. The filter used by an FEA explicitly imposes the concept of dominance on a partially ordered solution set. We show that the algorithm is provably robust for both linear and nonlinear problems and constraints. FEAs use a finite pattern of mutation offsets, and our analysis is closely related to recent convergence results for patternsearch methods. We discuss how properties of this pattern impact the ability of an FEA to converge to a constrained local optimum.
暂无评论