Deakin home > Deakin University Library > Deakin Research Online > Parallelization of the discrete gradient method of non-smooth optimization and its applications
Openly accessible

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.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads
beliakov-dgpar-2003.pdf Authors post print application/pdf 166.51KB 305

Title Parallelization of the discrete gradient method of non-smooth optimization and its applications
Author(s) Beliakov, Gleb
Monsalve Tobon, J.E.
Bagirov, A.M.
Conference name ICCS 2003 (Conference) (2003 : Melbourne, Vic., and Saint Petersburg, Russia)
Conference location Melbourne, Australia and St. Petersburg, Russia
Conference dates 2-4 June 2003
Title of proceedings Computational science - ICCS 2003 : international conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003 : proceedings
Editor(s) Sloot, Peter
Abramson, David
Bogdanov, Alexander
Gorbachev, Yuriy
Dongarra, Jack
Zomaya, Albert
Publication date 2003
Start page 592
End page 601
Publisher Springer
Place of publication Berlin, Germany
Summary 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.

Notes The original publication can be found at www.springerlink.com
ISBN 3540401962
9783540401964
ISSN 0302-9743
1611-3349
Language eng
Field of Research 010301 Numerical Analysis
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2003, Springer-Verlag Berlin Heidelberg
Persistent URL http://hdl.handle.net/10536/DRO/DU:30004953

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
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 drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 1 times in Scopus
Access Statistics: 420 Abstract Views, 305 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:43:33 EST