Global Optimization - Logarithmic Transformation
Public DepositedLogarithmic transformation is a method used to change geometric programs into their convex forms. A geometric program, or GP, is a type of global optimization problem that concerns minimizing a subject to constraint functions so as to allow one to solve unique non-linear programming problems. All geometric programs contain functions called posynomials that are inherently non-convex. Due to this fact, solving geometric problems can be computationally intensive and finding a global optimum solution is not guaranteed. However, by creating a logarithmic transformation for a problem, one can solve for the globally optimum solution quicker and easier. A logarithmic transformation is not the only transformation which allows. One can also use an exponential transformation to obtain the same result. A logarithmic transformation can also be used on signomial programs, which are an extension of geometric programs
- Last modified
- 11/29/2018
- Creator
- DOI
- Keyword
- Rights statement
Relationships
- In Collection:
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
2_Logarithmic_transformation_-_optimization.pdf | 2018-11-29 | Public |
|