Geometric Programming for Circuit Optimization
S. Boyd and S.-J. Kim
Proceedings of International Symposium on Physical Design (ISPD), pages 44–46, April 2005.
This tutorial concerns a method for solving a variety of circuit sizing and optimization problems, which is based on formulating the problem as a geometric program (GP), or a generalized geometric program (GGP). These nonlinear, constrained optimization problems can be transformed to convex optimization problems, and then solved (globally) very efficiently.