Parallelization of the discrete gradient method of non-smooth optimization and its applications

Title: Parallelization of the discrete gradient method of non-smooth optimization and its applications
Creator: Beliakov, Gleb; Tobon, Monsalve; Bagirov, Adil
Date: 2003
Type: Text; Conference paper
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/45386
Identifier: vital:1272
Abstract: We investigate parallelization and performance of the discrete gradient method of nonsmooth optimization. This derivative free method is shown to be an effective optimization tool, able to skip many shallow local minima of nonconvex nondifferentiable objective functions. Although this is a sequential iterative method, we were able to parallelize critical steps of the algorithm, and this lead to a significant improvement in performance on multiprocessor computer clusters. We applied this method to a difficult polyatomic clusters problem in computational chemistry, and found this method to outperform other algorithms.; E1
Publisher: Melbourne : Springer
Relation: Paper presented at Computational Science ICCS 2003 Conference, Melbourne : 2nd June, 2003
Rights: Copyright Springer
Rights: This metadata is freely available under a CCO license
Subject: Parallelization; Discrete; Gradient; Nonsmooth; Optimisation
Reviewed