Multidimensional Global Optimization Method Using Numerically Calculated Derivatives
نویسندگان
چکیده
منابع مشابه
Local Optimization Method with Global Multidimensional Search for descent
This paper presents a new method for solving global optimization problems. We use a local technique based on the notion of discrete gradients for finding a cone of descent directions and then we use a global cutting angle algorithm for finding global minimum within the intersection of the cone and the feasible region. We present results of numerical experiments with well-known test problems and...
متن کاملNumerically Estimating Derivatives During Simulations
When a function’s value is known at several distinct points, there exist “numerical differentiation” formulas which provide estimates for the first derivative, and with various error bounds. In fact, many times the numerical differentiation formula chosen must be complex to avoid intolerable error as shown below. However, in computer simulations, as well as in real-time programming, while sever...
متن کاملGlobal Optimization of Stacking Sequence in a Laminated Cylindrical Shell Using Differential Quadrature Method
Based on 3-D elasticity approach, differential quadrature method (DQM) in axial direction is adopted along with Globalized Nelder–Mead (GNM) algorithm to optimize the stacking sequence of a laminated cylindrical shell. The anisotropic cylindrical shell has finite length with simply supported boundary conditions. The elasticity approach, combining the state space method and DQM is used to obtain...
متن کاملGenetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use of the procedure known as grammatical evolution. The method can be considered as a “genetic” modification of the Controlled Random Search procedure due to Price. The user may code the objective function either in C++ o...
متن کاملThe GLOBAL optimization method revisited
The multistart clustering global optimization method called GLOBAL has been introduced in the 1980s for bound constrained global optimization problems with black-box type objective function. Since then the technological environment has been changed much. The present paper describes shortly the revisions and updates made on the involved algorithms to utilize the novel technologies, and to improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.11.164