Digital Circuit Optimization via Geometric Programming

DOI10.1287/opre.1050.0254zbMath1165.90655OpenAlexW2119652329MaRDI QIDQ5322147

Mark A. Horowitz, Seung-Jean Kim, Dinesh D. Patil, Stephen P. Boyd

Publication date: 18 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.5003

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Analytic circuit theory (94C05)

Related Items

Variation-aware clock network buffer sizing using robust multi-objective optimization, Data fitting with geometric-programming-compatible softmax functions, An efficient convexification method for solving generalized geometric problems, Robust and reliable portfolio optimization formulation of a chance constrained problem, A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Tractable approximate robust geometric programming, A convex programming solution for gate-sizing with pipelining constraints, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms, Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms, CVXGEN: a code generator for embedded convex optimization, A method of sequential log-convex programming for engineering design, Sparse identification of posynomial models, Robust chance-constrained geometric programming with application to demand risk mitigation, Hyperloop system optimization, Quantum theory in finite dimension cannot explain every general process with finite memory, Geometric programming approach to doping profile design optimization of metal-oxide-semiconductor devices, Efficient Convexification Strategy for Generalized Geometric Programming Problems, Copula theory approach to stochastic geometric programming, Path following in the exact penalty method of convex programming, Relative entropy optimization and its applications, Multi-objective geometric programming problem with \(\epsilon\)-constraint method, Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems, Robust resource allocations in temporal networks, Joint optimisation of price, warranty and recovery planning in remanufacturing of used products under linear and non-linear demand, return and cost functions, Estimating cell probabilities in contingency tables with constraints on marginals/conditionals by geometric programming with applications, Relative Entropy Relaxations for Signomial Optimization, Solving a posynomial geometric programming problem with fully fuzzy approach, On the Fuzzy Fractional Posynomial Geometric Programming Problems, Inner approximation algorithm for generalized linear multiplicative programming problems, Disciplined geometric programming, A tutorial on geometric programming, Unnamed Item, Derivative-free robust optimization for circuit design