Timeline for Maximizing the minimum of piecewise linear functions in high dimensional space
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2011 at 15:31 | comment | added | Jeff | @Gerhard: Interesting idea! You make a good point about redundancies among constraints, with regard to finding a maximum. If branch-and-bound doesn't coverage quickly, I think I'll try adding in elements of this approach. Thanks much. | |
| Aug 14, 2011 at 2:39 | comment | added | Gerhard Paseman | Maybe I should say + 0.35 instead of + 0.7. Anyway, the high dimensionality of things may work in your favor. Gerhard "Just Bit Shift The Answer" Paseman, 2011.08.13 | |
| Aug 14, 2011 at 2:34 | comment | added | Gerhard Paseman | If I have it right, the 21st root of 0.001 is 0.7 roughly, so I think $a_{least} + 0.7$ is a good starting value for t, and after that it will be how many digits of precision you will need. Gerhard "High Dimensional Boxes Are Tiny" Paseman, 2011.08.13 | |
| Aug 14, 2011 at 0:25 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |