GB
|
Registered User
|
I'm an undergraduate who's pretty into math. Heading to computer science grad school in Fall 2013.
|
|
Apr 27 |
awarded | ● Commentator |
|
Apr 27 |
comment |
When does the finite union of convex sets have a hole in it? Man, that is a cool answer you linked to. I do have a way to test intersections, so that will do perfectly. |
|
Apr 27 |
revised |
When does the finite union of convex sets have a hole in it? edited title |
|
Apr 27 |
revised |
When does the finite union of convex sets have a hole in it? added 299 characters in body |
|
Apr 27 |
comment |
When does the finite union of convex sets have a hole in it? 1. Yes, it's the union, not the intersection of the sets (the intersection would be convex =) ). 2. Yes, I am attempting a floating-point algorithm. Rather than place restrictions on the sets, I'm hoping to use standard convex optimization techniques as a subroutine (the $\epsilon$-fudginess in these techniques is okay; I'd be fine with an algorithm that reports "the functions come within $\epsilon$ of being hole-less"). |
|
Apr 27 |
revised |
When does the finite union of convex sets have a hole in it? deleted 16 characters in body; edited title; added 55 characters in body |
|
Apr 27 |
asked | When does the finite union of convex sets have a hole in it? |
|
Apr 11 |
asked | What is the complexity of finding the number (mod 2) of multicolored edges on a loop? |
|
Mar 1 |
awarded | ● Yearling |
|
Feb 5 |
asked | Geometric interpretations of matrix inverses |
|
Jan 22 |
asked | Does this result exist in the literature? |
|
Jan 8 |
asked | Is there a general process for conditioning a stochastic process above a boundary? |
|
Jan 6 |
awarded | ● Critic |
