Convexity-based algorithms for design centering

Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Two new geometrical algorithms for design centering are presented. In each case, the feasible region is first approximated by a convex polytope. The first algorithm inscribes the largest Hessian ellipsoid within the approximating polytope. The second assumes Gaussian parameter distributions, formulates the problem as a convex programming problem, and uses an efficient algorithm to perform the optimization.

Original languageEnglish (US)
Title of host publicationProc 1993 IEEE ACM Int Conf Comput Aided Des
Editors Anon
PublisherPubl by IEEE
Pages206-209
Number of pages4
ISBN (Print)0818644923
StatePublished - Dec 1 1993
EventProceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design - Santa Clara, CA, USA
Duration: Nov 7 1993Nov 11 1993

Other

OtherProceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design
CitySanta Clara, CA, USA
Period11/7/9311/11/93

Fingerprint Dive into the research topics of 'Convexity-based algorithms for design centering'. Together they form a unique fingerprint.

  • Cite this

    Sapatnekar, S. S., Vaidya, P. M., & Kang, S. M. (1993). Convexity-based algorithms for design centering. In Anon (Ed.), Proc 1993 IEEE ACM Int Conf Comput Aided Des (pp. 206-209). Publ by IEEE.