Impact
~2k
people reached
- 0 posts edited
- 0 helpful flags
- 5 votes cast
Oct
28 |
comment |
Java library for SDP
Unfortunately Mosek does not solve semi definite programming problems (docs.mosek.com/kb/Can_MOSEK_solve_semi-definite_optimizati.html). I've decided to write a java interface to CSDP since it looks certain that there are no existing java interfaces. |
Oct
27 |
comment |
Java library for SDP
@Igor in reply to (c): Harsh words! Well it depends where you are coming from. Sometimes you have to use someone's code that is only in java and sometimes you are willing to take a hit in perf for design reasons. Lets not get into that. About the java interface with C: I guess you are talking about JNI, I am aware of that. |
Oct
27 |
comment |
Java library for SDP
@Igor: Your angry birds example does not have any intersection with MO. My post is not a math research question but chances that someone in MO community might have encountered this are higher than in SO. Anyways, feel feel to vote it down - let the votes decide. |
Oct
27 |
comment |
Java library for SDP
I meant to say "small number of ppl at stackoverflow". |
Oct
27 |
comment |
Java library for SDP
I tried stackoverflow prior to this. There is a very small number of people who use things other than cplex, so it wasn't fruitful. |
Oct
27 |
asked | Java library for SDP |
Sep
18 |
revised |
Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center
edited title |
Sep
18 |
comment |
Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center
Ah, that's a good point. I'll change tight to mean the smallest |
Sep
18 |
revised |
Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center
edited title |
Sep
18 |
awarded | Commentator |
Sep
18 |
revised |
Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center
added 287 characters in body |
Sep
18 |
comment |
Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center
@Suvrit: Ah, we can assume that the ellipsoids intersect and they are "full" ellipsoids (not embedded in a subspace). @Joseph: But I do not want to compute the intersection itself which would be quite expensive. Also, this is the link to the W. Kahan paper I talked about in my question: cs.berkeley.edu/~wkahan/Ellipint.pdf |
Sep
18 |
revised |
Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center
edited title |
Sep
18 |
asked | Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center |
Aug
30 |
awarded | Disciplined |
Aug
30 |
awarded | Organizer |
Aug
23 |
accepted | cayley transform for non-square matrices |
Aug
23 |
comment |
cayley transform for non-square matrices
Hi Juliano, I used conjugate gradient on Stiefel manifolds. Your suggestion of writing any point on the Stiefel manifold as product of m x m unitary matrix with a fixed m x n Y_0 is very neat. cheers |
May
30 |
awarded | Scholar |
May
28 |
revised |
cayley transform for non-square matrices
edited tags |