A method of approximating a quasidifferential
Computational Mathematics and Mathematical Physics
Journal of Global Optimization
Fast Algorithm for the Cutting Angle Method of Global Optimization
Journal of Global Optimization
Cutting Angle Method and a Local Search
Journal of Global Optimization
A Hybrid Descent Method for Global Optimization
Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Controlled Markov chains, graphs, and Hamiltonicity
Foundations and Trends® in Stochastic Systems
Hi-index | 0.00 |
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 with the so-called cluster function. These results confirm that the proposed algorithms allows one to find a global minimizer or at least a deep local minimizer of a function with a huge amount of shallow local minima.