English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A method of Sequential Log-Convex Programming (SLCP) is constructed thatexploits the log-convex structure present in many engineering design problems.The mathematical structure of Geometric Programming (GP) is combined with theability of Sequential Quadratic Program (SQP) to accommodate a wide range ofobjective and constraint functions, resulting in a practical algorithm that canbe adopted with little to no modification of existing design practices. Threetest problems are considered to demonstrate the SLCP algorithm, comparing itwith SQP and the modified Logspace Sequential Quadratic Programming (LSQP). Inthese cases, SLCP shows up to a 77% reduction in number of iterations comparedto SQP, and an 11% reduction compared to LSQP. The airfoil analysis code XFOILis integrated into one of the case studies to show how SLCP can be used toevolve the fidelity of design problems that have initially been modeled as GPcompatible. Finally, a methodology for design based on GP and SLCP is brieflydiscussed.

A Method of Sequential Log-Convex Programming for Engineering Design