Timeline for Optimization problem related to parity check code
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2011 at 5:05 | answer | added | Jyrki Lahtonen | timeline score: 2 | |
| Aug 16, 2011 at 8:23 | comment | added | Jyrki Lahtonen | @David: This was asked at math.stackexchange as well. I refer the interested reader to the discussion in loc.cit. for a `better' problem description. I know nothing about convex optimization, but it does appear to me to be quite the wrong methodology. Prasenjit, if we set as our target that losing one box never causes data loss (otherwise, what's the point?), then what is wrong with the greedy algorithm: keep adding content to a box until the matrix describing what's outside that box fails to have a full rank. Rinse. Repeat. Randomize order, redo? | |
| Aug 14, 2011 at 14:09 | comment | added | aaaaaa | Now, the function G is coming as a non-linear function of the matrix entries. Also the domain set of G is set of all n-tuples where elements of a tuple are 0 or 1. So, the domain set is not a convex set, so convex optimization techniques can't be applied here. How to solve this optimization problem? I have posted this problem to math.stackexchange.com also. Thanks | |
| Aug 9, 2011 at 7:01 | comment | added | David Roberts♦ | Where is the question here? Please see mathoverflow.net/faq and mathoverflow.net/howtoask This question may be more suited to math.stackexchange.com | |
| Aug 9, 2011 at 5:57 | history | asked | aaaaaa | CC BY-SA 3.0 |