Timeline for A lower bound of a particular convex function
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8, 2011 at 10:14 | answer | added | Maciej Skorski | timeline score: 1 | |
| Apr 18, 2011 at 8:41 | answer | added | Denis Serre | timeline score: 1 | |
| Apr 17, 2011 at 20:40 | comment | added | Jennifer Gao | @Suvrit: is it? The expression for the roots of a cubic looks pretty complicated to me, and the lower bound is just a pair of terms. | |
| Apr 17, 2011 at 8:50 | comment | added | Suvrit | but computing the roots of your cubic don't seem to be too much more complicated than computing the lower bounds? en.wikipedia.org/wiki/Cubic_function | |
| Apr 17, 2011 at 8:33 | history | edited | Jennifer Gao | CC BY-SA 3.0 |
Changed the convex combination
|
| Apr 17, 2011 at 8:29 | comment | added | Jennifer Gao | Sorry, I don't understand -- how does the "splitting" work? | |
| Apr 16, 2011 at 19:32 | history | edited | Jennifer Gao | CC BY-SA 3.0 |
Removed the bit about a 1.5 approximation
|
| Apr 16, 2011 at 19:24 | comment | added | Nishant Chandgotia | can't you just split 1/x into the linear combination and use that. | |
| Apr 16, 2011 at 19:20 | history | edited | Jennifer Gao | CC BY-SA 3.0 |
Added a caveat on a and b
|
| Apr 16, 2011 at 19:15 | history | asked | Jennifer Gao | CC BY-SA 3.0 |