A tutorial on geometric programming
The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationThe Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Engineering Optimization Theory and Practice
Rao, S. S. (2019) · Wiley eBooks · doi:10.1002/9781119454816 · Cited by 3,578
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-74503-9 · Cited by 2,804
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
A simple distributed autonomous power control algorithm and its convergence
Foschini, G. J., & Miljanic, Z. (1993) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.260747 · Cited by 1,723
Simple accurate expressions for planar spiral inductances
Mohan, S. S., del Mar Hershenson, M., Boyd, S. P., & Lee, T. H. (1999) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.792620 · Cited by 1,627
Self-citationNumerical optimization techniques for engineering design
Vanderplaats, G. N. (1999) · Medical Entomology and Zoology · Cited by 1,204
Palomar, D. P., Cioffi, J. M., & Lagunas, M. A. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.815393 · Cited by 1,185
Nonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
Numerical Optimization (Springer Series in Operations Research and Financial Engineering)
Nocedal, J., & Wright, S. J. (2000) · Cited by 1,112
Logical Effort: Designing Fast CMOS Circuits
Sutherland, I. E., Sproull, B., & Harris, D. M. (1999) · CERN Document Server (European Organization for Nuclear Research) · Cited by 916
Signal Delay in RC Tree Networks
Rubinstein, J., Penfield, P., & Horowitz, M. (1983) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1983.1270037 · Cited by 848
Kandukuri, S., & Boyd, S. (2002) · IEEE Transactions on Wireless Communications · doi:10.1109/7693.975444 · Cited by 642
Self-citationChiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
Geometric Programming : Theory and Application
Duffin, R. J., Peterson, E. L., & Zener, C. M. (1967) · Cited by 604
Principles of Optimal Design: Modeling and Computation
Papalambros, P. Y., & Wilde, D. J. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626418 · Cited by 574
TILOS: A Posynomial Programming Approach to Transistor Sizing
Fishburn, J. P., & Dunlop, A. E. (2003) · Springer eBooks · doi:10.1007/978-1-4615-0292-0_23 · Cited by 557
Optimal design of a CMOS op-amp via geometric programming
Hershenson, M. D., Boyd, S. P., & Lee, T. H. (2001) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.905671 · Cited by 548
Self-citationGeometric Programming for Communication Systems
Chiang, M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019574 · Cited by 423
Bandwidth extension in CMOS with optimized on-chip inductors
Mohan, S. S., Hershenson, M. D. M., Boyd, S. P., & Lee, T. H. (2000) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.826816 · Cited by 410
Self-citationApproximation of wiring delay in MOSFET LSI
Sakurai, T. (1983) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1983.1051966 · Cited by 406
Empirical Distributions in Selection Bias Models
Vardi, Y. (1985) · The Annals of Statistics · doi:10.1214/aos/1176346585 · Cited by 382
An exact solution to the transistor sizing problem for CMOS circuits using convex optimization
Sapatnekar, S. S., Rao, V. B., Vaidya, P. M., et al. (1993) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.248073 · Cited by 313
CHENG, T. C. E. (1991) · IIE Transactions · doi:10.1080/07408179108963838 · Cited by 287
(2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347 · Cited by 259
Geometric Programming for Communication Systems
Chiang, M. (2005) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000005 · Cited by 247
Genetic Programming: Theory and Practice
O’Reilly, U.-M., Yu, T., Riolo, R., & Worzel, B. (2006) · Genetic Programming · doi:10.1007/0-387-23254-0_1 · Cited by 226
Global optimization in generalized geometric programming
Maranas, C. D., & Floudas, C. A. (1997) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(96)00282-7 · Cited by 225
Julian, D., Chiang, M., O'Neill, D., & Boyd, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019292 · Cited by 220
Self-citationGenetic and Evolutionary Computation
(2006) · Genetic Programming · doi:10.1007/1-4020-7895-1_4 · Cited by 204
Geometric Programming: Methods, Computations and Applications
Ecker, J. G. (1980) · SIAM Review · doi:10.1137/1022058 · Cited by 189
Optimization-based transistor sizing
Shyu, J.-M., Sangiovanni-Vincentelli, A. L., Fishburn, J. P., & Dunlop, A. E. (1988) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.1000 · Cited by 177
Digital Circuit Optimization via Geometric Programming
Boyd, S. P., Kim, S.-J., Patil, D. D., & Horowitz, M. A. (2005) · Operations Research · doi:10.1287/opre.1050.0254 · Cited by 175
Self-citationGlobal Optimization in Generalized Geometric Programming
(2012) · Springer eBooks · doi:10.1007/springerreference_72312 · Cited by 171
Optimal wiresizing under Elmore delay model
Cong, J., & Leung, K.-S. (1995) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.365123 · Cited by 152
An infeasible interior-point algorithm for solving primal and dual geometric programs
Kortanek, K. O., Xu, X., & Ye, Y. (1997) · Mathematical Programming · doi:10.1007/bf02614382 · Cited by 145
Application of geometric programming to transformer design
Jabr, R. A. (2005) · IEEE Transactions on Magnetics · doi:10.1109/tmag.2005.856921 · Cited by 132
Dynamic optimization of multipass milling operations via geometric programming
Sönmez, A. İ., Baykasoğlu, A., Dereli, T., & Fılız, İ. H. (1999) · International Journal of Machine Tools and Manufacture · doi:10.1016/s0890-6955(98)00027-3 · Cited by 130
Linearizing Geometric Programs
Duffin, R. J. (1970) · SIAM Review · doi:10.1137/1012043 · Cited by 127
Simultaneous driver and wire sizing for performance and power optimization
Cong, J., & Koh, C. (1994) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.335010 · Cited by 126
Solution of generalized geometric programs
Avriel, M., Dembo, R. S., & Passy, U. (1975) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620090112 · Cited by 123
Swahn, B., & Hassoun, S. (2006) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1146909.1147047 · Cited by 69
Optimization of phase-locked loop circuits via geometric programming
Colleran, D. M., Portmann, C. L., Hassibi, A., Crusius, C. A. R., Mohan, S. S., Boyd, S., Lee, T. H., & Hershenson, M. D. M. (2004) · Custom Integrated Circuits Conference · doi:10.1109/cicc.2003.1249422 · Cited by 68
Self-citationOptimal wiresizing for interconnects with multiple sources
Cong, J., & He, L. (1996) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/238997.239018 · Cited by 65
Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents
Sherali, H. D. (1998) · Journal of Global Optimization · doi:10.1023/a:1008249414776 · Cited by 63
Global optimization for signomial discrete programming problems in engineering design
Tsai, J., Li, H.-L., & Hu, N.-Z. (2002) · Engineering Optimization · doi:10.1080/03052150215719 · Cited by 43
Gate sizing: finFETs vs 32nm bulk MOSFETs
Swahn, B., & Hassoun, S. (2006) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.2006.229286 · Cited by 39
Optimal allocation of local feedback in multistage amplifiers via geometric programming
Dawson, J. L., Boyd, S., Hershenson, M. D. M., & Lee, T. H. (2001) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.903183 · Cited by 28
Self-citationKim, S.-J., Boyd, S., Yun, S., Patil, D. D., & Horowitz, M. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9011-5 · Cited by 28
Self-citationOptimal module sizing in VLSI floorplanning by nonlinear programming
Rosenberg, E. (1989) · Mathematical Methods of Operations Research · doi:10.1007/bf01415168 · Cited by 24
Wong, D. (1981) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(81)90018-7 · Cited by 21
Speeding up pipelined circuits through a combination of gate sizing and clock skew optimization
Sathyamurthy, H., Sapatnekar, S. S., & Fishburn, J. P. (1995) · doi:10.5555/224841.225092 · Cited by 21
An optimization model of communications satellite planning
Dutta, A., & Rama, D. V. (1992) · IEEE Transactions on Communications · doi:10.1109/26.163567 · Cited by 16
Irreversible Adaptive Allocation Rules
Hu, I., & Wei, C.-Y. (1989) · The Annals of Statistics · doi:10.1214/aos/1176347144 · Cited by 12
Asymptotically efficient strategies for a stochastic scheduling problem with order constraints
Fuh, C., & Hu, I. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957475 · Cited by 10
GP based transistor sizing for optimal design of nanoscale CMOS inverter
Pattanaik, M., Banerjee, S., & Bahinipati, B. K. (2004) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2003.1230962 · Cited by 6
Cited by
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Power Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
A rewriting system for convex optimization problems
Agrawal, A., Verschueren, R., Diamond, S., & Boyd, S. (2018) · Journal of Control and Decision · doi:10.1080/23307706.2017.1397554 · Cited by 669
Self-citationDi, B., Song, L., & Li, Y. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2606100 · Cited by 444
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Huang, J., & Swindlehurst, A. L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161295 · Cited by 347
Metadata
- Authors
- Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A.
- Venue
- Optimization and Engineering
- Published
- 2007-03
- Volume
- 8
- Issue
- 1
- ISSN
- 1389-4420 (ISSN-L)
- 1573-2924
- OpenAlex
- W2171048418
- Cited by
- 1,195
- References
- 63
- FWCI
- 79.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.