Proceedings of the 2012 International Symposium on Nonlinear Theory and its Applications
2012
Session Number:A4L-A
Session:
Number:215
Continuous Global Minimization Method Based on Special Mathematical Structure of Objective Functions and Adjacent Local Minima Search
Hideo KANEMITSU,
pp.215-218
Publication Date:
Online ISSN:2188-5079
[1] Dzemyda, G. ,Šaltenis, V. and Zilinskas, A. :“Stochastic and Global Optimization,” Kluwer Acad. Publ., Dordrecht, 2002.
[2] A. Hedar and M. Fukushima: “Minimizing multimodal functions by simplex coding genetic algorithm,” Optimization Methods and Software, vol.18, 265-282, 2003.
[3] Kanemitsu, H., et al.: An Algorithm for Globally Minimizing a Function with Local Minimal Values whose Sequence is Almost Lower Unimodal, Proc. of NOLTA'2009, 580-583, 2009.
[4] Kanemitsu, H.: “Studies on Continuous Global Optimization Methods using Mathematical Structure of Problems,” Doctoral dissertation, Hokkaido University, 2011(In Japanese).
[5] C.T. Kelly, “Iterative Methods for Optimization,”SIAM, 1999.
[6] N.-G. Kim, Y. Park, J.-W. Kim, E. Kim and S.W. Kim, “Digital Pattern Search and Its Hybridization with Genetic Algorithms for Bound Constrained Global Optimization,” IEICE-EA, vol.E92-A, 481-492, 2009.