Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
