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, 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 ...

Abstract: In this article, we describe a deterministic optimization framework for the conceptual-stage design of aerodynamically-actuated wingsails. The primary objective of high-performance sailing ...

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

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 ...

Integer programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many practical ...