Inclusion functions and global optimization II |
| |
Authors: | R E Moore H Ratschek |
| |
Institution: | (1) Department of Computer and Information Science, Ohio State University, 43210 Columbus, OH, USA;(2) Mathematisches Institut der Universität Düsseldorf, FR Germany |
| |
Abstract: | This paper discusses algorithms of Moore, Skelboe, Ichida, Fujii and Hansen for solving the global unconstrained optimization problem. These algorithms have been tried on computers, but a thorough theoretical discussion of their convergence properties has been missing. The discussion was started in part I of this paper (Mathematical Programming 33 (1985) 300–317) where the convergence to the global minimum was studied. The present paper is concerned with the different behaviours of these algorithms when they are used for the determination of global minimum points. The solution sets of the algorithms can be a subset of the set of global minimum points,G, a superset ofG, or exactlyG. The algorithms are applicable to a very general class of functions: functions which are continuous, and have suitable inclusion functions. The number of global minimum points can be infinite.This work was supported by the Deutsche Forschungsgemeinschaft. |
| |
Keywords: | Global unconstrained optimization |
本文献已被 SpringerLink 等数据库收录! |
|