The parallel tunneling method

Authors:
Susana Gómez;Nelson del Castillo;Longina Castellanos;Julio Solano
Affiliations:
IIMAS, UNAM, Apdo Postal 20-726, Mexico D.F. 01000, Mexico;IIMAS, UNAM, Apdo Postal 20-726, Mexico D.F. 01000, Mexico;ICIMAF, Calle 15, Vedado Cd. de la Habana, Cuba;IIMAS, UNAM, Apdo Postal 20-726, Mexico D.F. 01000, Mexico
Venue:
Parallel Computing - Special issue: Parallel computing in numerical optimization
Year:
2003

Citing 2
Cited 3

Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization

ACM Transactions on Mathematical Software (TOMS)
A Theoretical Investigation of a Parallel Genetic Algorithm

Proceedings of the 3rd International Conference on Genetic Algorithms

Nonlinear optimization and parallel computing

Parallel Computing - Special issue: Parallel computing in numerical optimization
Mobile Sensor Routing for Parameter Estimation of Distributed Systems Using the Parallel Tunneling Method

International Journal of Applied Mathematics and Computer Science - Selected Problems of Computer Science and Control
Agent based distributed parallel tunneling algorithms

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the parallel version of the tunneling methods for global optimization of bounded constrained problems, taking advantage of the stochastic element of these methods that allows a smart exploration of the space. When the search for a point in another valley starting from points in a neighbourhood of the last (and best) local minimum along random directions, is performed at the same time on several processors, a more efficient and fast global optimization method is obtained. The performance of the parallel method is illustrated on several academic problems and on the specially difficult Lennard-Jones molecular structures problem.