Geometric programming for circuit optimization
Stephen Boyd, Seung Jean Kim · 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.