DocumentCode :
2578715
Title :
A computational geometric approach to feasible region division in constrained global optimization
Author :
Perttunen, Cary D.
Author_Institution :
Dept. of Electr Eng., Louisville Univ., KY, USA
fYear :
1991
fDate :
13-16 Oct 1991
Firstpage :
585
Abstract :
Proposes the use of the Delaunay triangulation for feasible region division in constrained global optimization. The mathematical foundations for its use, along with the practical considerations for its implementation, are presented. The Delaunay triangulation algorithm is implemented in C.D. Perttunen´s nonparametric method (1989). Results of this application are shown through the use of a standard set of test functions. The use of Delaunay triangulation is shown to yield a search in which the scatter plot of search points mimics the contour plot of the objective function under consideration
Keywords :
computational geometry; optimisation; search problems; Delaunay triangulation; computational geometric approach; constrained global optimization; feasible region division; nonparametric method; objective function contour plot; search point scatter plot; Algorithm design and analysis; Computational geometry; Constraint optimization; Design optimization; Iterative algorithms; Iterative methods; Optimization methods; Scattering; Search methods; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man, and Cybernetics, 1991. 'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE International Conference on
Conference_Location :
Charlottesville, VA
Print_ISBN :
0-7803-0233-8
Type :
conf
DOI :
10.1109/ICSMC.1991.169748
Filename :
169748
Link To Document :
بازگشت