Timeline for Maximize a sum of log of sum
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2015 at 3:47 | comment | added | Max Alekseyev | @Vuong Bui: This analysis suggests that $\lambda$'s should be biased towards the indices $k$ with large column sums $C_k$. | |
| May 10, 2015 at 1:55 | comment | added | Vuong Bui | Very interesting, thanks a lot. But in our application, $n$ is so small, while $m$ is much greater than n, so the equality condition of the AGM inequality rarely occurs. Futher more, I am interested in the $\lambda$ values, not the maximum L values. However, thanks for the upper bound. | |
| May 9, 2015 at 15:20 | history | answered | Max Alekseyev | CC BY-SA 3.0 |