Logspace Sequential Quadratic Programming for Design Optimization
Abstract
A novel approach to exploiting the log-convex structure present in many design problems is developed by modifying the classical Sequential Quadratic Programming (SQP) algorithm. The modified algorithm, Logspace Sequential Quadratic Programming (LSQP), inherits some of the computational efficiency exhibited by log-convex methods such as Geometric Programing and Signomial Programing, but retains the the natural integration of black box analysis methods from SQP. As a result, significant computational savings is achieved without the need to invasively modify existing black box analysis methods prevalent in practical design problems. In the cases considered here, the LSQP algorithm shows a 40-70% reduction in number of iterations compared to SQP.
Cite
@article{arxiv.2105.14441,
title = {Logspace Sequential Quadratic Programming for Design Optimization},
author = {Cody Karcher},
journal= {arXiv preprint arXiv:2105.14441},
year = {2021}
}
Comments
22 pages, 7 figures, 5 tables, accepted to the AIAA Journal (in final revisions); Table percentages have been corrected and a citation has been corrected