Parallel Line Search in Method of Feasible Directions
Tóm tắt
In this paper the line search procedure within the method of feasible directions is parallelized and used in the solution of constrained structural optimization problems. As the objective function is linear in the variables, the step size problem reduces to a zero finding problem. That is, the step size is the distance along the direction vector to the nearest constraint boundary. Zero finding is accomplished in two steps—a ‘march’ along the direction vector to bracket the zero followed by an interval reduction scheme. Both these steps are parallelized using MPI for message passing. When implemented on a cluster of workstations, for a convergence parameter of 10−6, the time for optimization of composite pressure vessel reduces from 3
$$\frac{1}{2}$$
hours to
$$\frac{1}{2}$$
hour when 64 processors are utilized, with a speedup of 7.0.
Tài liệu tham khảo
S. Burgee, A. A. Giunta, R. Narducci, L.T. Watson, B. Grossman, and R. T. Haftka, "A coarse grained parallel variable-complexity multidisciplinary optimization paradigm," The International Journal of Supercomputer Applications and High Performance Computingvol. 10, no. 4, pp. 269–299, 1996.
X. Chen and M. M. Kostereva, "Methods of feasible directions: A review," Progress in Optimization, Kluwer Academic Publishers, Norwell, MA, 2000, pp. 205–219.
S. Chinchalkar and T. F. Coleman, "Parallel structural optimization applied to bone remodeling on distributed memory machines," Computational Optimization and Applicationsvol. 4, no. 4, pp. 375–392, 1995.
N. I. M. Gould, Ph. L. Toint, and A. R. Conn, Springer Series in Computational Mathematics, vol 17, 1992
M. Grauer and D. B. Pressmar (eds.), Lecture Notes in Economics and Mathematical Systems, vol. 367, "Parallel Computing and Mathematical Optimization," Proc. of the Workshop on Parallel Algorithms and Transputers for Optimization, held at the University of Siegen, FRG, Springer-Verlag, Nov. 9, 1990.
http://endo.sandia.gov/DAKOTA/
http://www-fp.mcs.anl.gov/tao/
http://www.ilog.com/
J. P. B. Leite, "Parallel simulated annealing for structural optimization," Computers and Structuresvol. 73, nos. 1-5, pp. 545–564, 1999.
T. P. Lin and J. S. Arora, "Parallel processing in structural optimization," Computing in Civil Engineering(New York), Sixth Conference on Computing in Civil Engineering, Atlanta, GA, USA, Sept. 11-13, 1989, pp. 740–747.
MPICH-A Portable Implementation of MPI, http://www-unix.mcs.anl.gov/mpi/mpich/, 2002.
S. L. Padula and S. C. Stone, "Parallel implementation of large-scale structural optimization," Structural Optimizationvol. 16, nos. 2-3, pp. 176–185, 1998.
Portland Compiler Group, http://www.pgroup.com, 2002.
S. D. Rajan, D. T. Nguyen, M. D. Deshpande, and L. Harrell, "Optimal design of engineering systems using MPI-enabled genetic algorithm," TINMCM 2002, University of Miskolc, Miskolc, Hungary, July 2002.
H. Sakamoto, S. Takada, J. Itoh, M. Miyazaki, and A. Hijikata, "Investigation of a practical method of structural optimization by genetic algorithms," JSME International Journal, Series A: Solid Mechanics and Material Engineeringvol. 44, no. 3, pp. 330–337, 2001.
Vanderplaats R&D, http://www.vrand.com/curnproj.htm, 2002.
G. Venter and B. Watson, "Efficient optimization algorithms for parallel applications," 8th AIAA/USAF/NASA/ISSMO Symposium at Multidisciplinary Analysis and Optimization, Long Beach, CA, Sept. 6-8, 2000.
Xicheng,Wang, F.W.Williams, and D. Kennedy, "Parallel structural optimization method and its implementation on a transtech paramid," Computer Methods in Applied Mechanics and Engineeringvol. 135, nos. 3-4, pp. 381–392, 1996.
G. Zoutendijk, Method of Feasible Directions, Elsevier, 1960.