By Topic

A modified univariate search algorithm

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
$31 $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

2 Author(s)
Al-Saleh, M.A. ; Dept. of Electr. & Comput. Eng., Umm Al-Qura Univ., Makkah, Saudi Arabia ; Mir, M.

This paper describes a modified univariate search algorithm that overcomes two major limitations of conventional univariate search method. It minimizes the probability of premature convergence to poor local minima by utilizing a non-deterministic search procedure based on an analogy with the analytical univariate search, and improves' the quality of solutions by dealing with populations of solutions rather than with single solutions for solving unconstrained as well as constrained optimization problems involving continuous or discrete variables. Unlike Genetic Algorithms (GA's), which also are based on non-deterministic search and exhibit intrinsic parallelism, the solutions do not interact or mix together to produce new solutions (offspring); instead, new solutions are generated by unilaterally updating a single variable at a time in individual solutions. Results of two test problems are presented and compared with those obtained by standard GA, modified GA, and an optimization program based on the method of feasible directions

Published in:

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on  (Volume:6 )

Date of Conference:

Jul 1999