A method of sequential log-convex programming for engineering design
Name
11081_2022_Article_9750.pdf
Size
2.45 MB
Format
Adobe PDF
Checksum (MD5)
9f9943be4c1b7a7e0e8a02da6c0c884e
Author(s)
Karcher, Cody
Haimes, Robert
Date Issued
July 25, 2022
Publisher
Springer US
Citation
Karcher, Cody and Haimes, Robert. 2022. "A method of sequential log-convex programming for engineering design."
Version
Final published version
Abstract
Abstract
A method of Sequential Log-Convex Programming (SLCP) is constructed that exploits the log-convex structure present in many engineering design problems. The mathematical structure of Geometric Programming (GP) is combined with the ability of Sequential Quadratic Program (SQP) to accommodate a wide range of objective and constraint functions, resulting in a practical algorithm that can be adopted with little to no modification of existing design practices. Three test problems are considered to demonstrate the SLCP algorithm, comparing it with SQP and the modified Logspace Sequential Quadratic Programming (LSQP). In these cases, SLCP shows up to a 77% reduction in number of iterations compared to SQP, and an 11% reduction compared to LSQP. The airfoil analysis code XFOIL is integrated into one of the case studies to show how SLCP can be used to evolve the fidelity of design problems that have initially been modeled as GP compatible. Finally, a methodology for design based on GP and SLCP is briefly discussed.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11081-022-09750-3
