Geometric_program
A geometric program (GP) is an optimization problem of the form
where are posynomials and are monomials. In the context of geometric programming (unlike standard mathematics), a monomial is a function from to defined as
where and . A posynomial is any sum of monomials.[1][2]
Geometric programming is closely related to convex optimization: any GP can be made convex by means of a change of variables.[2] GPs have numerous applications, including component sizing in IC design,[3][4] aircraft design,[5] maximum likelihood estimation for logistic regression in statistics, and parameter tuning of positive linear systems in control theory.[6]