By Topic

On the performance of pure adaptive search

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

2 Author(s)
B. W. Schmeiser ; Sch. of Ind. Eng., Purdue Univ., West Lafayette, IN, USA ; Jin Wang

Studies the pure adaptive search (PAS), an iterative optimization algorithm whose next solution is chosen to be uniformly distributed over the set of feasible solutions that are no worse than the current solution. We extend the results of Patel, Smith and Zabinsky (1988) and Zabinsky and Smith (1992). In particular, we (1) show that PAS converges to the optimal solution almost certainly, (2) show that each PAS iteration reduces the expected remaining feasible-region volume by 50%, and (3) improve the Patel, Smith and Zabinsky complexity measure for convex problems

Published in:

Simulation Conference Proceedings, 1995. Winter

Date of Conference:

3-6 Dec 1995