Investigating the existence of function roots using particle swarm optimization

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 2, Issue , 2003, Pages 1448-1455

  Parsopoulos, Konstantinos E ^a   Vrahatis, Michael N ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATION; GEOMETRY; NONLINEAR ANALYSIS; PARTICLE SWARM OPTIMIZATION (PSO); TOPOLOGY;

INFINITY NORM; LIPSCHITZ CONSTANT; MATHEMATICAL TOOLS; OPTIMAL COMPLEXITY ALGORITHMS; TEST PROBLEM; TOPOLOGICAL DEGREE;

FUNCTIONS;

EID: 3142734341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299841     Document Type: Conference Paper

References (53)

1. O. Aberth. Computation of topological degree using interval arithmetic, and applications. Math. Comp., 62:171-178, 1994.
2. M.A. Abido. Optimal design of power system stabilizers using particle swarm optimization. IEEE Trans. Energy Conversion, 17(3):406-413, 2002.
3. D.K. Agrafiotis and W. Cedeno. Feature selection for structure-activity correlation using binary particle swarms. Journal of Medicinal Chemistry, 45(5): 10981107, 2002.
4. E. Bonabeau, M. Dorigo, and G. Theraulaz. From Natural to Artificial Swarm Intelligence. Oxford University Press, New York, 1999.
5. T. Boult and K. Sikorski. Complexity of computing topological degree of Lipschitz functions in n dimensions. J. Complexity, 2:44-59, 1986.
6. T. Boult and K. Sikorski. An optimal complexity algorithm for computing the topological degree in two dimensions. SIAM J. Sci. Statist. Comput., 10.686-698, 1989.
7. M. Clerc and J. Kennedy. The particle swarm- explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput., 6(1):58-73, 2001.
8. A.R Cockshott and B.E. Hartman. Improving the fermentation medium for Echinocandin B production part ii: Particle swarm optimization. Process Bio-chemistry, 36:661-669, 2001.
9. Kavvadias D.J., F.S. Makri, and M.N. Vrahatis. Locating and computing arbitrarily distributed zeros. SIAM Journal on Scientific Computing, 21 (3):954 - 969, 1999.
10. Kavvadias, D.J. and M.N. Vrahatis. Locating and computing all the simple roots and extrema of a function. SIAM Journal on Scientific Computing, 17(5): 12321248, 1996.
11. R.C. Eberhart and Y. Shi. Comparison between genetic algorithms and particle swarm optimization. In V.W. Porto, N. Saravanan, D. Waagen, and A.E. Eiben, editors, Evolutionary Programming, volume VII, pages 611-616. Springer, 1998.
12. R.C. Eberhart, P. Simpson, and R. Dobbins. Computational Intelligence PC Tools. Academic Press, 1996.
13. P.C. Fourie and A.A. Groenwold. The particle swarm optimization algorithm in size and shape optimization. Struct. Multidisc. Optim., 23:259-267, 2002.
14. R.B. Kearfott. An efficient degree-computation method for a generalized method of bisection. Numer. Math., 32:109-127, 1979.
15. R.B. Kearfott, J. Dian, and A. Neumaier. Existence verification for singular zeros of complex nonlinear systems. SIAM J. Numer. Anal, 38:360-379, 2000.
16. J. Kennedy. The behavior of particles. In V.W. Porto, N. Saravanan, D. Waagen, and A.E. Eiben, editors, Evolutionary Programming, volume VII, pages 581- 590. Springer, 1998.
17. J. Kennedy and R.C. Eberhart. Particle swarm optimization. In Proceedings IEEE International Con-ference on Neural Networks, volume IV, pages 1942-1948. Piscataway, NJ, 1995. IEEE Service Center.
18. J. Kennedy and R.C. Eberhart. Swarm Intelligence. Morgan Kaufmann Publishers, 2001.
19. E.C. Laskari, K.E. Parsopoulos, and M.N. Vrahatis. Particle swarm optimization for integer programming. In Proceedings of the IEEE 2002 Congress on Evolutionary Computation, pages 1576-1581, Hawaii (HI), USA, 2002. IEEE Press.
20. E.C. Laskari, K.E. Parsopoulos, and M.N. Vrahatis. Particle swarm optimization for minimax problems. In Proceedings of the IEEE 2002 Congress on Evolutionary Computation, pages 1582-1587, Hawaii (HI), USA. 2002. IEEE Press.
21. N.G. Lloyd. Degree Theory. Cambridge University Press, Cambridge, 1978.
22. W.Z. Lu, H.Y. Fan, A.Y.T. Leung, and J.C.K. Wong. Analysis of pollutant levels in central hong kong applying neural network method with particle swarm optimization. Environmental Monitoring and Assessment, 79:217-230, 2002.
23. B. Mourrain. M.N. Vrahatis, and J.C. Yakoubsohn. On the complexity of isolating real roots and computing with certainty the topological degree. J. Complexity, 18:612-640, 2002.
24. J.M. Ortega and W.C. Rheinbolt. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
25. C.O. Ourique, E.C. Biscaia, and J. Carlos Pinto. The use of particle swarm optimization for dynamical analysis in chemical processes. Computers and Chemical Engineering, 26:1783-1793, 2002.
26. K.E. Parsopoulos, E.C. Laskari, and M.N. Vrahatis. Particle identification by light scattering through evolutionary algorithms. In Proceedings of the 1st International Conference for Mathematics and Informatics for Industry, pages 97-108, Thessaloniki, Greece, 2003.
27. K.E. Parsopoulos, V.P. Plagianakos, G.D. Magoulas, and M.N. Vrahatis. Objective function stretching to alleviate convergence to local minima. Nonlinear Analysis, Theory, Methods & Applications. 47{5):3419-3424, 2001.
28. K.E. Parsopoulos, V.P. Plagianakos, G.D. Magoulas, and M.N. Vrahatis. Stretching technique for obtaining global minimizers through particle swarm optimization. In Proceedings of the Particle Swarm Optimization Workshop, pages 22-29, Indianapolis (IN), USA, 2001.
29. K.E. Parsopoulos and M.N. Vrahatis. Initializing the particle swarm optimizer using the nonlinear simplex method. In A. Grmela and N.E. Mastorakis, editors, Advances in Intelligent Systems, Fuzzy Systems, Evolutionary Computation, pages 216-221. WSEAS Press, 2002.
30. K.E. Parsopoulos and M.N. Vrahatis. Particle swarm optimization method for constrained optimization problems. In P. Sincak, J. Vascak, V. Kvasnicka, and J. Pospichal, editors, Intelligent Technologies-Theory and Application: New Trends in Intelligent Technologies, volume 76 of Frontiers in Artificial Intelligence and Applications, pages 214-220. IOS Press, 2002.
31. K.E. Parsopoulos and M.N. Vrahatis. Recent ap-proaches to global optimization problems through particle swarm optimization. Natural Computing, 1(2- 3):235-306, 2002.
32. K.E. Parsopoulos and M.N. Vrahatis. Computing periodic orbits of nondifferentiable/discontinuous mappings through particle swarm optimization. In Proceedings of the IEEE Swarm Intelligence Symposium, pages 34-41, Indianapolis (IN), USA, 2003.
33. E. Picard, Sur le nombre des racines communes a plusieurs equations simultances. Journ. de Math. Pure et Appl. (4e serie), 8:5-24, 1892.
34. E. Picard. Traite d'analyse. Gauthier-Villars, Paris, 1922.
35. T. Ray and K.M. Liew. A swarm metaphor for multi- objective design optimization. Engineering Optimization, 34(2): 141-153, 2002.
36. A. Saldam, I. Ahmad, and S. Al-Madani. Particle swarm optimization for task assignment problem. Microprocessors and Microsystems, 26:363-371, 2002.
37. Y. Shi and R.C. Eberhart. A modified particle swarm optimizer. In Proceedings IEEE Conference on Evolutionary Computation, Anchorage, AK, 1998. IEEE Service Center.
38. Y. Shi and R.C. Eberhart. Parameter selection in particle swarm optimization. In V.W. Porto, N. Sara- vanan, D. Waagen, and A.E. Eiben, editors, Evolutionary Programming, volume VII, pages 591-600. Springer, 1998.
39. K.A. Sikorski. Optimal Solution of Nonlinear Equations. Oxford University Press, 2001.
40. F. Stenger. Computing the topological degree of a mapping in R. Numer. Math., 25:23-38, 1975.
41. M. Stynes. An algorithm for numerical calculation of topological degree. Appl. Anal., 9:63-77, 1979.
42. M. Stynes. A simplification of stenger's topological degree formula. Numer. Math., 33:147-156, 1979.
43. M. Stynes. On the construction of sufficient refinements for computation of topological degree. Numer. Math., 37:453-462, 1981.
44. V. Tandon, H. El-Mounayri, and H. Kishawy. Nc end milling optimization using evolutionary computation. Int. J. Mackirte Tools & Manufacture, 42:595-605, 2002.
45. I.C. Trelea. The particle swarm optimization algorithm: Convergence analysis and parameter selection. Information Processing Letters, 85:317-325, 2003.
46. M.N. Vrahatis. Solving systems of nonlinear equations using the nonzero value of the topological degree. ACM Trans. Math. Software, 14:312-329, 1988.
47. M.N. Vrahatis. A short proof and a generalization of Miranda's existence theorem. Proc. Amer. Math. Soc., 107:701-703, 1989.
48. M.N. Vrahatis. An efficient method for locating and computing periodic orbits of nonlinear mappings. J. Comp. Phys., 119:105-119, 1995.
49. M.N. Vrahatis, T.C. Bountis, and M. Kollmann. Periodic orbits and invariant surfaces of 4-D nonlinear mappings. Inter. J. Bifiire. Chaos, 6:1425-1437, 1996.
50. M.N. Vrahatis and K.I. lordanidis. A rapid generalized method of bisection for solving systems of non-linear equations. Numer. Math., 49:123-138, 1986.
51. M.N. Vrahatis, H. Isliker, and T.C. Bountis. Structure and breakdown of invariant tori in a 4-D mapping model of accelerator dynamics. Inter. J. Bifurc. Chaos, 7:2707-2722, 1997.
52. M.N. Vrahatis, O. Ragos, T. Skiniotis, F.A. Zafiropoulos, and T.N. Grapsa. The topological degree theory for the localization and computation of complex zeros of Bessel functions. Numer. Funct. Anal. Optimiz., 18:227-234, 1997.
53. M. Yokoyama. Computing the topological degree with noisy functions. J. Complexity, 13:272-278, 1997.