论文标题
一种用于工程设计的顺序日志编程编程的方法
A Method of Sequential Log-Convex Programming for Engineering Design
论文作者
论文摘要
构建了一种顺序对数符号编程（SLCP）的方法，该方法利用了许多工程设计问题中存在的对数凸结构。几何编程（GP）的数学结构与顺序二次程序（SQP）的能力相结合，可容纳广泛的客观和约束函数，从而产生实用算法，几乎无法修改现有设计实践。考虑了三个测试问题来证明SLCP算法，将其与SQP和修改的Logspace顺序二次编程（LSQP）进行了比较。在这些情况下，与SQP相比，SLCP的迭代次数降低了77％，与LSQP相比降低了11％。翼型分析代码Xfoil被整合到其中一个案例研究中，以说明如何使用SLCP来发展最初已将其建模为GP兼容的设计问题的保真度。最后，简要讨论了基于GP和SLCP的设计方法。
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.
