Timeline for Is the p-norm of a matrix strictly log-convex?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2018 at 14:24 | history | edited | Andreas Thom | CC BY-SA 4.0 |
deleted 1 character in body
|
| May 15, 2014 at 19:58 | vote | accept | Hannes Thiel | ||
| May 15, 2014 at 17:16 | history | edited | Hannes Thiel | CC BY-SA 3.0 |
added 6 characters in body
|
| May 15, 2014 at 17:05 | history | edited | Hannes Thiel | CC BY-SA 3.0 |
added 131 characters in body
|
| May 15, 2014 at 16:49 | comment | added | Suvrit | What I meant was trying to just provide sufficient conditions for the direct inequality, by using closedness of log-cvxity under addition and multiplication. Clearly, it does not hold in general :-) | |
| May 15, 2014 at 16:47 | answer | added | Terry Tao | timeline score: 5 | |
| May 15, 2014 at 16:46 | comment | added | Hannes Thiel | Do you have a proof in mind? The inequality is not true in general, for example for the identity matrix. | |
| May 15, 2014 at 16:40 | comment | added | Suvrit | Why not just prove it directly? $\phi\left(\tfrac{p+q}{2}\right) < \sqrt{\phi(p)\phi(q)}$, where $\phi(p)=\|A\|_p$. | |
| May 15, 2014 at 15:44 | history | asked | Hannes Thiel | CC BY-SA 3.0 |