Geometric programming: Difference between revisions

Revision as of 01:14, 15 January 2019

Revision as of 10:20, 20 October 2019

Line 19:

| pages = 278

| isbn = 0-471-22370-0

}}</ref><ref name="tutorial">S. Boyd, S. J. Kim, L. Vandenberghe, and A. Hassibi. ''[httphttps://wwwweb.stanford.edu/~boyd/papers/gp_tutorial.html A Tutorial on Geometric Programming].'' Retrieved 820 JanuaryOctober 2019.</ref>

Geometric programming is

closely related to [[convex optimization]]: any GP can be made convex by means of a change of variables. <ref name="tutorial"/> GPs have numerous applications, including component sizing in [[Integrated circuit|IC]] design<ref>M. Hershenson, S. Boyd, and T. Lee. ''[http://www.stanford.edu/~boyd/papers/opamp.html Optimal Design of a CMOS Op-amp via Geometric Programming].'' Retrieved 8 January 2019.</ref><ref> S. Boyd, S. J. Kim, D. Patil, and M. Horowitz. ''[httphttps://wwwweb.stanford.edu/~boyd/papers/gp_digital_ckt.html Digital Circuit Optimization via Geometric Programming].'' Retrieved 820 JanuaryOctober 2019.</ref>, aircraft design<ref>W. Hoburg and P. Abbeel. ''[https://people.eecs.berkeley.edu/~pabbeel/papers/2014-AIAA-GP-aircraft-design.pdf Geometric programming for aircraft design optimization].'' AIAA Journal 52.11 (2014): 2414-2426.</ref>, and [[maximum likelihood estimation]] for [[logistic regression]] in [[statistics]].

==Convex form==