JGO
2010
13 years 7 months ago
2010
JGO
2010
13 years 7 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
JGO
2010
13 years 7 months ago
2010
JGO
2010
13 years 7 months ago
2010
JGO
2010
13 years 11 months ago
2010
JGO
2010
13 years 11 months ago
2010
JGO
2010
13 years 11 months ago
2010
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
JGO
2010
13 years 11 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
JGO
2010
13 years 11 months ago
2010
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
JGO
2010
13 years 11 months ago
2010
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange...