A tutorial on geometric programming
作者： Stephen Boyd , Seung-Jean Kim , Lieven Vandenberghe , Arash Hassibi
DOI: 10.1007/S11081-007-9001-7
关键词:
摘要: A geometric program (GP) is a type of mathematical optimization problem characterized by objective and constraint functions that have a special form. Recently developed solution …
stanford.edu
springer.com
uchicago.edu 
sci-hub.se 参考文章(178)
J.R. Rajasekera, M. Yamada, Estimating the Firm Value Distribution Function by Entropy Optimization and Geometric Programming Annals of Operations Research. ,vol. 105, pp. 61- 75 ,(2001) , 10.1023/A:1013397314149
Panos Y. Papalambros, Douglass J. Wilde, Principles of Optimal Design Cambridge University Press. ,(2003)
Varun Aggarwal, Una-May O’Reilly, Design of Posynomial Models for Mosfets: Symbolic Regression Using Genetic Algorithms Springer, Boston, MA. pp. 219- 236 ,(2007) , 10.1007/978-0-387-49650-4_14
Douglass J. Wilde, Globally optimal design ,(1978)
Robert Tibshirani, Trevor Hastie, Jerome H. Friedman, The Elements of Statistical Learning ,(2001)
Sabih H. Gerez, Algorithms for VLSI design automation ,(1998)
R. J. Clasen, THE LINEAR-LOGARITHMIC PROGRAMMING PROBLEM ,(1963)
V. Singh, D. Chandra, H. Kar, Improved Routh–PadÉ Approximants: A Computer-Aided Approach IEEE Transactions on Automatic Control. ,vol. 49, pp. 292- 296 ,(2004) , 10.1109/TAC.2003.822878
Singiresu S. Rao, Engineering Optimization : Theory and Practice ,(2011)
Charles S Beightler, Douglass J Wilde, Foundations of Optimization. ,(1967)