Feasible Region Approximation Using Convex Polytopes
by
Sachin S. Sapatnekar
,
Pravin M. Vaidya
,
S.M. Kang
| Citations: | 1 - 1 self |
BibTeX
@MISC{Sapatnekar_feasibleregion,
author = {Sachin S. Sapatnekar and Pravin M. Vaidya and S.M. Kang},
title = {Feasible Region Approximation Using Convex Polytopes},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new technique for polytope approximation of the feasible region for a design is presented. This method is computationally less expensive than the simplicial approximation method #1#. Results on several circuits are presented, and it is shown that the qualityofthe polytope approximation is substantially better than an ellipsoidal approximation.
Citations
| 842 | Linear and nonlinear programming - Luenberger - 1984 |
| 43 | Computer-Aided Analysis of Electronic Circuits: Algorithms and Computational Techniques - Chua, Lin - 1975 |
| 14 | The simplicial approximation approach to design centering,”IEEE Trans - Director, Hachtel - 1982 |
| 13 | The ellipsoidal technique for design centering and region approximation - Abdel-Malik, Hassan - 1991 |
| 3 | A convex programming approach to transistor sizing for CMOS circuits - Sapatnekar, Vaidya, et al. - 1991 |
