Alex
unread,Jan 27, 2011, 11:45:54 PM1/27/11Sign in to reply to author
Sign in to forward
You do not have permission to delete messages in this group
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to ellipsoids
Kaushik,
Thanks for the file and sorry it takes some time for me to respond.
Now I know what the problem is.
The way the intersection of an ellipsoid with a polytope is computed
right now is that compute ellipsoidal approximations of intersections
of this ellipsoid and the halfspaces, intersection of which forms the
polytope.
Suppose, you have N halfspaces, H_1, ..., H_N.
So, here is what happens, given original ellipsoid E and polytope
P(H_1,...,H_N):
E_1 = intersection of E and H_1;
E_2 = intersection of E_1 and H_2;
...
E_N = intersection of E_(N-1) and H_N.
E_N is the result - it approximates the intersection of E and P.
Now, the problem is that for some k, 1<k<N,
E_k = intersection of E_(k-1) and H_k returned empty ellipsoid
(ellipsoid of dimension 0).
In theory, it should not happen (if the intersection of E and P is
nonempty).
In practice, it can be caused by the rounding error of some sort of
the optimization solver or something like that.
Anyway, I would like to rewrite the ellipsoid and polytope
intersection using different algorithm, which should produce less
conservative result.
If you bear with me, I'll let you know once I'm done.
best,
Alex.