A method of sequential log-convex programming for engineering design
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...
Main Authors: | Karcher, Cody, Haimes, Robert |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | English |
Published: |
Springer US
2022
|
Online Access: | https://hdl.handle.net/1721.1/144164 |
Similar Items
-
Data fitting with signomial programming compatible difference of convex functions
by: Karcher, Cody J.
Published: (2022) -
A heuristic for including black box analysis tools into a geometric programming formulation
by: Karcher, Cody Jacob
Published: (2017) -
Decoupled multiagent path planning via incremental sequential convex programming
by: Chen, Yu Fan, et al.
Published: (2016) -
An Optimization Centered Approach to Multifidelity Aircraft Design
by: Karcher, Cody Jacob
Published: (2023) -
On the convergence of the exponential multiplier method for convex programming
Published: (2003)