Return
Revised filled function methods for global optimization
DOI:10.1016/S0096-3003(99)00266-0.png)
Abstract
En 中文
This paper considers the unconstrained global optimization with the revised filled function methods. The minimization sequence could leave from a local minimizer to a better minimizer of the objective function through solving an unary equation or minimizing an auxiliary function constructed at the local minimizer. Some promising numerical results are also included. (C) 2001 Elsevier Science Inc. All rights reserved.
Keywords:
global minimizer
local minimizer
the filled function method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available

