Signomial

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A "signomial" is an algebraic function of one or more independent variables. It is perhaps most easily thought of as an algebraic extension of multi-dimensional polynomials—an extension that permits exponents to be arbitrary real numbers (rather than just non-negative integers) while requiring the independent variables to be strictly positive (so that division by zero and other inappropriate algebraic operations are not encountered).

Formally, let X be a vector of real, positive numbers.

X = (x_1, x_2, x_3, \dots, x_n)^T

Then a signomial function has the form

f(x_1, x_2, \dots, x_n) = \sum_{i=1}^M \left(c_i \prod_{j=1}^n x_j^{a_{ij}}\right)

where the coefficients c_k and the exponents a_{ij} are real numbers. Signomials are closed under addition, subtraction, multiplication, and scaling.

If we restrict all c_i to be positive, then the function f is a posynomial. Consequently, each signomial is either a posynomial, the negative of a posynomial, or the difference of two posynomials. If, in addition, all exponents a_{ij} are non-negative integers, then the signomial becomes a polynomial whose domain is the positive orthant.

For example,

f(x_1, x_2, x_3) = 2.7 x_1^2x_2^{-1/3}x_3^{0.7} - 2x_1^{-4}x_3^{2/5}

is a signomial.

The term "signomial" was introduced by Richard J. Duffin and Elmor L. Peterson in their seminal joint work on general algebraic optimization—published in the late 1960s and early 1970s. A recent introductory exposition is optimization problems.[1] Although nonlinear optimization problems with constraints and/or objectives defined by signomials are normally harder to solve than those defined by only posynomials (because, unlike posynomials, signomials are not guaranteed to be globally convex), signomial optimization problems often provide a much more accurate mathematical representation of real-world nonlinear optimization problems.

References[edit]

  1. ^ C. Maranas and C. Floudas, Global optimization in generalized geometric programming, pp. 351–370, 1997.

External links[edit]