Tree annealing for constrained optimization
Proceedings of the Thirty-Fourth Southeastern Symposium on System Theory (Cat. No.02EX540) - Trang 412-416
Tóm tắt
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.
Từ khóa
#Constraint optimization #Simulated annealing #Partitioning algorithms #Parameter estimation #Binary trees #Neural networks #Least squares methods #Optimization methods #Stochastic processes #SunTài liệu tham khảo
sun, 2001, vPIMM Visual Parameter Identification for MODFLOW and MT3DMS
10.1007/978-3-662-02598-7
10.1109/21.108301
10.1137/1.9781611970906
kirkpatrick, 1983, Optimization by simulated annealing Science, 220, 671