Geometric programming

A geometric program (GP) is an optimization problem of the form : \begin{array}{ll} \mbox{minimize} & f_0(x) \\ \mbox{subject to} & f_i(x) \leq 1, \quad i=1, \ldots, m\\ & g_i(x) = 1, \quad i=1, \ldots, p, \end{array} where f_0,\dots,f_m…

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A geometric program (GP) is an optimization problem of the form

minimizef0(x)subject tofi(x)≤1,i=1,…,mgi(x)=1,i=1,…,p,

where f0,…,fm are posynomials and g1,…,gp are monomials. In the context of geometric programming (unlike standard mathematics), a monomial is a function from ℝ++n to ℝ defined as

x↦cx1a1x2a2⋯xnan

where c>0  and ai∈ℝ. 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]

Convex form

edit edit source

Geometric programs are not in general convex optimization problems, but they can be transformed to convex problems by a change of variables and a transformation of the objective and constraint functions. In particular, after performing the change of variables yi=log⁡(xi) and taking the log of the objective and constraint functions, the functions fi, i.e., the posynomials, are transformed into log-sum-exp functions, which are convex, and the functions gi, i.e., the monomials, become affine. Hence, this transformation transforms every GP into an equivalent convex program.[2] In fact, this log-log transformation can be used to convert a larger class of problems, known as log-log convex programming (LLCP), into an equivalent convex form.[7]

Software

edit edit source

Several software packages exist to assist with formulating and solving geometric programs.

  • MOSEK is a commercial solver capable of solving geometric programs as well as other non-linear optimization problems.
  • CVXOPT is an open-source solver for convex optimization problems.
  • GPkit is a Python package for cleanly defining and manipulating geometric programming models. There are a number of example GP models written with this package here.
  • GGPLAB is a MATLAB toolbox for specifying and solving geometric programs (GPs) and generalized geometric programs (GGPs).
  • CVXPY is a Python-embedded modeling language for specifying and solving convex optimization problems, including GPs, GGPs, and LLCPs.[7]

See also

edit edit source

References

edit edit source
  1. ^ Richard J. Duffin; Elmor L. Peterson; Clarence Zener (1967). Geometric Programming. John Wiley and Sons. p. 278. ISBN 0-471-22370-0. Wikipedia revision 1333882786, retrieved 2026-11-19
  2. ^ a b c S. Boyd, S. J. Kim, L. Vandenberghe, and A. Hassibi. A Tutorial on Geometric Programming. Retrieved 20 October 2019. Wikipedia revision 1333882786, retrieved 2026-11-19
  3. ^ M. Hershenson, S. Boyd, and T. Lee. Optimal Design of a CMOS Op-amp via Geometric Programming. Retrieved 8 January 2019. Wikipedia revision 1333882786, retrieved 2026-11-19
  4. ^ S. Boyd, S. J. Kim, D. Patil, and M. Horowitz. Digital Circuit Optimization via Geometric Programming. Retrieved 20 October 2019. Wikipedia revision 1333882786, retrieved 2026-11-19
  5. ^ W. Hoburg and P. Abbeel. Geometric programming for aircraft design optimization. AIAA Journal 52.11 (2014): 2414-2426. Wikipedia revision 1333882786, retrieved 2026-11-19
  6. ^ Ogura, Masaki; Kishida, Masako; Lam, James (2020). "Geometric Programming for Optimal Positive Linear Systems". IEEE Transactions on Automatic Control. 65 (11): 4648–4663. arXiv:1904.12976. Bibcode:2020ITAC...65.4648O. doi:10.1109/TAC.2019.2960697. ISSN 0018-9286. S2CID 140222942. Wikipedia revision 1333882786, retrieved 2026-11-19
  7. ^ a b A. Agrawal, S. Diamond, and S. Boyd. Disciplined Geometric Programming. Retrieved 8 January 2019. Wikipedia revision 1333882786, retrieved 2026-11-19

Text derived from https://en.wikipedia.org/w/index.php?oldid=1333882786 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001333882786 · captured 2026-01-20 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “Geometric programming”, snapshot enwiki-001333882786. https://encyclopegia.org/a/geometric-programming