## A Trust-Region Algorithm for Global Optimization

We consider the global minimization of a bound-constrained function with a so-called funnel structure. We develop a two-phase procedure that uses sampling, local optimization, and Gaussian smoothing to construct a smooth model of the underlying funnel. The procedure is embedded in a trust-region framework that avoids the pitfalls of a fixed sampling radius. We present … Read more

## Gradient-Controlled, Typical-Distance Clustering for Global Optimization

We present a stochastic global optimization method that employs a clustering technique which is based on a typical distance and a gradient test. The method aims to recover all the local minima inside a rectangular domain. A new stopping rule is used. Comparative results on a set of test functions are reported. Citation Preprint, no … Read more

## Fuzzy Control of Stochastic Global Optimization Algorithms and Very Fast Simulated Reannealing

This paper presents a fuzzy control approach for improving convergence time in stochastic global minimization algorithms .We show concrete results when the method is applied to an efficient algorithm based on ideas related to Simulated Annealing. Article Download View Fuzzy Control of Stochastic Global Optimization Algorithms and Very Fast Simulated Reannealing

## Local optima smoothing for global optimization

It is widely believed that in order to solve large scale global optimization problems an appropriate mixture of local approximation and global exploration is necessary. Local approximation, if first order information on the objective function is available, is efficiently performed by means of local optimization methods. Unfortunately, global exploration, in absence of some kind of … Read more

## The global optimization of Morse clusters by potential energy transformations

The Morse potential is a simple model pair potential that has a single parameter $\rho$ which determines the width of the potential well and allows a wide variety of materials to be modelled. Morse clusters provide a particularly tough test system for global optimization algorithms, and one that is highly relevant to methods that are … Read more

## A randomized global optimization method for protein-protein docking

In this paper we report results on the problem of docking two large proteins by means of a two-phase monotonic basin hopping method. Given an appropriate force field which is used to measure the interaction energy between two biomolecules which are considered as rigid bodies, we used a randomized global optimization methods based upon the … Read more

## New global optima for Morse clusters at $\rho=8$

We recently discovered 5 new putative globally optimum configurations for Morse clusters at $\rho=8$. This report contains some algorithmic details as well as the structures determined with our method. Citation Technical Report DSI 3-2003, Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Firenze, 2003. Article Download View New global optima for Morse clusters … Read more

## Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones clusters

A standard stochastic global optimization method is applied to the challenging problem of finding the minimum energy conformation of cluster of identical atoms interacting through the Lennard-Jones potential. The method proposed is based on the use of a two-phase local search procedure which is capable of significantly enlarge the basin of attraction of the global … Read more

## The Sample Average Approximation Method for Stochastic Programs with Integer Recourse

This paper develops a solution strategy for two-stage stochastic programs with integer recourse. The proposed methodology relies on approximating the underlying stochastic program via sampling, and solving the approximate problem via a specialized optimization algorithm. We show that the proposed scheme will produce an optimal solution to the true problem with probability approaching one exponentially … Read more