Constrained global optimization: algorithms and applications
Constrained global optimization: algorithms and applications
Global optimization
A filled function method for finding a global minimizer of a function of several variables
Mathematical Programming: Series A and B
The globally convexized filled functions for global optimization
Applied Mathematics and Computation
Terminal Repeller Unconstrained Subenergy Tunneling (TRUST) for fast global optimization
Journal of Optimization Theory and Applications
Revised filled function methods for global optimization
Applied Mathematics and Computation
New Classes of Globally Convexized Filled Functions for Global Optimization
Journal of Global Optimization
A Note on the Griewank Test Function
Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Hi-index | 0.00 |
An integral function and a vector sequence are constructed in this paper. Their theoretical and numerical properties are investigated. Based on the integral function and the vector sequence, an algorithm is proposed for solving a class of unconstrained global optimization problems. For the algorithm, convergence to a global minimizer is discussed under some conditions. Some typical examples are tested to illustrate the efficiency of the algorithm.