This paper concerns a method for digital circuit optimization based on formulating the problem as a geometric program (GP) or generalized geometric program (GGP), which can be transformed to a convex ...

Abstract: In this paper, performance and accuracy of both General Geometric Programming (GGP) and non-linear programming (NLP) algorithms, for optimization of low power VLSI circuits, have been ...

Abstract: In this paper, a fast optimization technique for CMOS analog circuits sizing is presented. The technique is based on geometric programming (GP) optimization. Although GP sizing is a very ...

Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

In this paper, we give an applications-oriented survey of geometric programming. This important class of nonlinear programming problems has been intensively studied over the past decade and has played ...