Author： Belegundu Ashok D. Damle Amol Rajan Subramaniam D. Dattaguru Bhagavatula Ville James St.
Publisher： Springer Publishing Company
ISSN： 1389-4420
Source： Optimization and Engineering, Vol.5, Iss.3, 2004-09, pp. : 379-388
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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½ hours to ½ hour when 64 processors are utilized, with a speedup of 7.0.
Related content
Access to resources
Recommend
A robust line search for learning control
By Driessen Brian J. Sadegh Nader Kwok Kwan S.
International Journal of Control, Vol. 74, Iss. 7, 2001-05 ,pp. :