On the Global Convergence of univariate-Dynamic Encoding Algorithm for Searches (uDEAS)
Author:
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5776-5781
Abstract
This paper provides a global convergence property of the univariate dynamic encoding algorithm for searches (uDEAS). uDEAS is a recent nonlinear optimization method which treats binary pseudo-matrices as variables to optimize. Since uDEAS can be classified into the generating set search method, the global convergence property of uDEAS is proved in the similar context. The proof of global convergence shows that uDEAS guarantees that an arbitrary starting point can reach a stationary point under general assumptions, which means that uDEAS is a reliable and robust optimization methodKeywords
This publication has 9 references indexed in Scilit:
- Parameter Identification of Induction Motors Using Dynamic Encoding Algorithm for Searches (DEAS)IEEE Transactions on Energy Conversion, 2005
- Numerical method for global optimisation: dynamic encoding algorithm for searchesIEE Proceedings - Control Theory and Applications, 2004
- Optimization by Direct Search: New Perspectives on Some Classical and Modern MethodsSIAM Review, 2003
- On the Convergence of Pattern Search AlgorithmsSIAM Journal on Optimization, 1997
- On the Convergence of the Multidirectional Search AlgorithmSIAM Journal on Optimization, 1991
- Lattice Approximations to the Minima of Functions of Several VariablesJournal of the ACM, 1969
- A Simplex Method for Function MinimizationThe Computer Journal, 1965
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961
- Theory of Positive Linear DependenceAmerican Journal of Mathematics, 1954