Geometric programming for circuit optimization
Geometric programming for circuit optimization
复制标题
用于电路优化的几何规划
DOI：
10.1145/1055137.1055148
复制
发表时间：
2005
影响因子：
3.1
通讯作者：
Seung
中科院分区：
文献类型：
--
作者：
Stephen P. Boyd;Seung
本教程涉及一种解决各种电路尺寸和优化问题的方法，该方法基于将问题公式化为几何规划（GP）或广义几何规划（GGP）。这些非线性约束优化问题可以转化为凸优化问题，然后非常有效地求解（全局）。
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.