Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 최동훈 | - |
dc.date.accessioned | 2018-04-03T05:05:17Z | - |
dc.date.available | 2018-04-03T05:05:17Z | - |
dc.date.issued | 2014-06 | - |
dc.identifier.citation | STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 50(5),p.739-753 | en_US |
dc.identifier.issn | 1615-147X | - |
dc.identifier.issn | 1615-1488 | - |
dc.identifier.uri | http://link.springer.com/article/10.1007%2Fs00158-014-1084-0 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11754/56359 | - |
dc.description.abstract | In this study, we propose a sequential convex programming (SCP) method that uses an enhanced two-point diagonal quadratic approximation (eTDQA) to generate diagonal Hessian terms of approximate functions. In addition, we use nonlinear programming (NLP) filtering, conservatism, and trust region reduction to enforce global convergence. By using the diagonal Hessian terms of a highly accurate two-point approximation, eTDQA, the efficiency of SCP can be improved. Moreover, by using an appropriate procedure using NLP filtering, conservatism, and trust region reduction, the convergence can be improved without worsening the efficiency. To investigate the performance of the proposed algorithm, several benchmark numerical examples and a structural topology optimization problem are solved. Numerical tests show that the proposed algorithm is generally more efficient than competing algorithms. In particular, in the case of the topology optimization problem of minimizing compliance subject to a volume constraint with a penalization parameter of three, the proposed algorithm is found to converge well to the optimum solution while the other algorithms tested do not converge in the maximum number of iterations specified. | en_US |
dc.description.sponsorship | This work was supported by the National Space Lab (NSL) program through the National Research Foundation (NRF) of Korea funded by the Ministry of Science, ICT and Future Planning (No. 2013042240) and by the NRF grant funded by the Korean government (No. 2013031530). | en_US |
dc.language.iso | en | en_US |
dc.publisher | SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA | en_US |
dc.subject | Sequential convex programming (SCP) | en_US |
dc.subject | Diagonal quadratic approximation (DQA) | en_US |
dc.subject | Filter method | en_US |
dc.subject | Conservatism | en_US |
dc.subject | Enhanced two-point diagonal quadratic approximation (eTDQA) | en_US |
dc.title | A globally convergent sequential convex programming using an enhanced two-point diagonal quadratic approximation for structural optimization | en_US |
dc.type | Article | en_US |
dc.relation.no | 5 | - |
dc.relation.volume | 50 | - |
dc.identifier.doi | 10.1007/s00158-014-1084-0 | - |
dc.relation.page | 739-753 | - |
dc.relation.journal | STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION | - |
dc.contributor.googleauthor | Park, Seon-ho | - |
dc.contributor.googleauthor | Jeong, Seung-Hyun | - |
dc.contributor.googleauthor | Yoon, Gil-Ho | - |
dc.contributor.googleauthor | Groenwold, Albert A | - |
dc.contributor.googleauthor | Choi, Dong-Hoon | - |
dc.relation.code | 2014039823 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DIVISION OF MECHANICAL ENGINEERING | - |
dc.identifier.pid | dhchoi | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.