Title :
Computational experience with a primal-dual interior point method for smooth convex placement problems
Author :
Kennings, Andrew ; Frazer, Mark ; Vannelli, Anthony
Author_Institution :
Ryerson Polytech. Univ., Toronto, Ont., Canada
fDate :
31 May-3 Jun 1998
Abstract :
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
Keywords :
circuit layout CAD; circuit optimisation; convex programming; integrated circuit layout; iterative methods; IC placement; benchmark problems; computational requirements; convex optimization; convex placement problems; iterative solvers; primal-dual interior point method; search directions; Circuit synthesis; Computational efficiency; Constraint optimization; Councils; Delay; Equations; Logic design; Optimization methods; Scholarships; Wire;
Conference_Titel :
Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on
Conference_Location :
Monterey, CA
Print_ISBN :
0-7803-4455-3
DOI :
10.1109/ISCAS.1998.705244
