Exponential transformation: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 135: Line 135:




Quadratic Geometric Programming Economics: <ref>T. R. Jefferson and C. H. Scott, [, "Quadratic geometric programming with application to machining economics]," ''Mathematical Programming'', vol. 31, pp. 137-152, 1985.</ref>   
Quadratic Geometric Programming Economics: <ref>T. R. Jefferson and C. H. Scott, [https://link.springer.com/content/pdf/10.1007/BF02591746.pdf, "Quadratic geometric programming with application to machining economics]," ''Mathematical Programming'', vol. 31, pp. 137-152, 1985.</ref>   


==Conclusion==
==Conclusion==

Revision as of 22:14, 13 December 2021

Author: Daphne Duvivier, Daniela Gil, Jacqueline Jackson, Sinclaire Mills, Vanessa Nobre (SYSEN 5800, Fall 2021)

Introduction

Exponential transformations are simple algebraic transformations of monomial functions through a variable substitution with an exponential variable. In computational optimization, exponential transformations are used for convexification of geometric programming constraints (posynomial) nonconvex optimization problems. Exponential transformation creates a convex function without changing the decision space of the problem. [1] The transformation can then be verified using the Hessian positive definite test to confirm that it is now a convex function. Through the use of exponential transformations, the overall time to solve a Nonlinear Programming (NLP) or a Mixed Integer Nonlinear Programming (MINLP) problem is reduced and simplifies the solution space enough to utilize normal NLP/MINLP solvers.

Theory & Methodology

Exponential transformation can be applied to geometric programs. A geometric program is a mathematical optimization problem. Geometric Programs take the form of:

convexification of a non-inferior frontier - based on having a differentiable objective function[1]

this would apply to any polynomial. A posynomial is defined as define polynomials:

Exponential transformation begins with a posynomial (Positive and Polynomial) noncovex function of the form [2] :

where and

A transformation of is applied [3]

The transformed function is presented as:

Exponential Transformation in Computational Optimization

Exponential transformation can be used for convexification of any Geometric MINLP that meets the criteria of equation 1. This is done by turning the problem into a nonlinear convex optimization problem through exponential transformation. Using the exponential substitution detailed above, all continuous variables in the function are transformed while binary variables are not transformed.

Additionally, as presented in Theorem 1 and accompanying proof in "Global optimization of signomial geometric programming using linear relaxation" by P. Shen, K. Zhang, given that a function is being minimized, it shows that after transformation all points on the transformed function are feasible in the original function and all objective values in the transformed function are the same or less than the original function. [2] Also presented by Li and Biswal, the bounds of the problem are not altered through exponential transformation. [1]

Numerical Example

Reformulating to exponents

Substituting

Simplifying by exponent properties

Example of Convexification Application in MINLP

The following MINLP problem can take a convexification approach using exponential transformation:

Using the exponential transformation to continuous variables by substituting and described the problem becomes the following:

With additional logarithmic simplification through properties of natural logarithm:

Where is unbounded due to logarithmic of 0 being indefinite.

The transformed objective function can be shown to be convex through the positive-definite test of the Hessian. For the example above, the Hessian is as follows [4]:

In order to prove the convexity of the transformed functions, the positive definite test of Hessian is used as defined in Optimization of Chemical Processes [5]. This tests the Hessian defined as:

to test that

where

for all

for functions the Hessian is defined as:


In the example above, the Hessian is defined as:

Therefore, H(x) is positive-definite and strictly convex.

Applications

Currently, various applications of exponential transformation can be seen in published journal articles and industry practices. Due to the closeness with logarithmic transformation, usually a combination of the approaches are used in practical solutions.

Global optimization of heat exchanger network synthesis problems with and without the isothermal mixing assumption:

  • As seen in eq(34) and (35) of the work by Björk and Westerlund, they employ an exponential transformation to convexify their optimization problem to employ a global optimization approach. [6]


Electrical Engineering Application: [7]


Quadratic Geometric Programming Economics: [8]

Conclusion

Exponential transformation is a useful method to convexify Geometric MINLP and obtain a global solution to the problem. Exponential transformation does not alter the bounds of the problem and allows for a convex objective function and constraints given that the conditions described within Theory & Methodology are satisfied. Geometric Programming transformation can be further explored through logarithmic transformation to address convexification.

References

  1. 1.0 1.1 1.2 D. Li and M. P. Biswal, "Exponential Transformation in Convexifying a Noninferior Frontier and Exponential Generating Method," Journal of Optimization Theory and Applications, vol. 99, pp. 183–199, 1998.
  2. 2.0 2.1 S. Boyd, S. J. Kim, and L. Vandenberghe et al., "A tutorial on geometric programming," Optimization and Engineering, vol. 8, article 67, 2007.
  3. I. E. Grossmann, "Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques," Optimization and Engineering, vol. 3, pp. 227–252, 2002.
  4. M. Chiang, "Geometric Programming for Communication Systems," 2005.
  5. T. F. Edgar, D. M. Himmelblau, and L. S. Lasdon, Optimization of Chemical Processes, McGraw-Hill, 2001.
  6. K. J. Björk and T. Westerlund, "Global optimization of heat exchanger network synthesis problems with and without the isothermal mixing assumption," Computers & Chemical Engineering, vol. 26, issue 11, pp. 1581-1593, 2002.
  7. C. Chu and D. F. Wong, "VLSI Circuit Performance Optimization by Geometric Programming," Annals of Operations Research, vol. 105, pp. 37-60, 2001.
  8. T. R. Jefferson and C. H. Scott, "Quadratic geometric programming with application to machining economics," Mathematical Programming, vol. 31, pp. 137-152, 1985.