We present a primal-dual interior point method (IPM) for solving smooth convex optimization problems which arise during the placement of integrated circuits. The interior point method represents a substantial enhancement in flexibility versus other methods while having similar computational requirements. We illustrate that iterative solvers are efficient for calculation of search directions during optimization. Computational results are presented on a set of benchmark problems for an analysis of the method.
展开▼
