By Topic

Particle swarm optimization for minimax problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
E. C. Laskari ; Dept. of Math., Patras Univ., Greece ; K. E. Parsopoulos ; M. N. Vrahatis

This paper investigates the ability of the Particle Swarm Optimization (PSO) method to cope with minimax problems through experiments on well-known test functions. Experimental results indicate that PSO tackles minimax problems effectively. Moreover, PSO alleviates difficulties that might be encountered by gradient-based methods, due to the nature of the minimax: objective function, and potentially lead to failure. The performance of PSO is compared with that of other established approaches, such as the sequential quadratic programming (SQP) method and a recently proposed smoothing technique

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:2 )

Date of Conference:

2002