By Topic

Tree annealing for constrained optimization

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

1 Author(s)
Sun, M. ; Dept. of Math., Alabama Univ., Tuscaloosa, AL, USA

In this article, we introduce an optimization algorithm that integrates the basic idea of simulated annealing and partitioning of the search domain by binary tree of subdomains. Also included in the algorithm are procedures that implement direct simple constraints on the decision variables. The algorithm can be used to solve various optimization problems arising from parameter identification, neural network training, and nonlinear least squares. Results on several examples are presented to illustrate typical performance of this algorithm after its presentation.

Published in:

System Theory, 2002. Proceedings of the Thirty-Fourth Southeastern Symposium on

Date of Conference: