loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04)
RSCS: A Parallel Simplex Algorithm for the Nimrod/O Optimization Toolset
Cork, Ireland
July 05-July 07
ISBN: 0-7695-2210-6
ASCII Text
x 
 
Andrew Lewis, David Abramson, Tom Peachey, "RSCS: A Parallel Simplex Algorithm for the Nimrod/O Optimization Toolset," Parallel and Distributed Computing, International Symposium on, pp. 71-78, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPDC.2004.44,
author = {Andrew Lewis and David Abramson and Tom Peachey},
title = {RSCS: A Parallel Simplex Algorithm for the Nimrod/O Optimization Toolset},
journal ={Parallel and Distributed Computing, International Symposium on},
volume = {0},
year = {2004},
isbn = {0-7695-2210-6},
pages = {71-78},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.44},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing, International Symposium on
TI - RSCS: A Parallel Simplex Algorithm for the Nimrod/O Optimization Toolset
SN - 0-7695-2210-6
SP71
EP78
A1 - Andrew Lewis,
A1 - David Abramson,
A1 - Tom Peachey,
PY - 2004
KW - Parallel programming
KW - optimization
KW - Nelder-Mead algorithm
VL - 0
JA - Parallel and Distributed Computing, International Symposium on
ER -
 
Andrew Lewis, Griffith University
David Abramson, Monash University
Tom Peachey, Monash University
This paper describes a method of parallelisation of the popular Nelder-Mead simplex optimization algorithms that can lead to enhanced performance on parallel and distributed computing resources. A reducing set of simplex vertices are used to derive search directions generally closely aligned with the local gradient. When tested on a range of problems drawn from real-world applications in science and engineering, this reducing set concurrent simplex (RSCS) variant of the Nelder-Mead algorithm compared favourably with the original algorithm, and also with the inherently parallel multidirectional search algorithm (MDS). All algorithms were implemented and tested in a general-purpose, grid-enabled optimization toolset.
Index Terms:
Parallel programming, optimization, Nelder-Mead algorithm
Citation:
Andrew Lewis, David Abramson, Tom Peachey, "RSCS: A Parallel Simplex Algorithm for the Nimrod/O Optimization Toolset," ispdc, pp.71-78, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.