85 search results - page 1 / 17 » Feasible Region Approximation Using Convex Polytopes |
ISCAS
1993
IEEE
13 years 9 months ago
1993
IEEE
ICCAD
1993
IEEE
13 years 9 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
CCE
2004
13 years 4 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...