Parallelization of the discrete gradient method of non-smooth optimization and its applications
Beliakov, Gleb, Monsalve Tobon, J.E. and Bagirov, A.M. 2003, Parallelization of the discrete gradient method of non-smooth optimization and its applications, in Computational science - ICCS 2003 : international conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003 : proceedings, Springer, Berlin, Germany, pp. 592-601.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Computational science - ICCS 2003 : international conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003 : proceedings
Sloot, Peter Abramson, David Bogdanov, Alexander Gorbachev, Yuriy Dongarra, Jack Zomaya, Albert
Place of publication
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.
The original publication can be found at www.springerlink.com
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org.