Timeline for algorithm for finding the minimizer of a almost convex function
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9, 2016 at 14:48 | answer | added | Cristóbal Guzmán | timeline score: 1 | |
| Sep 23, 2016 at 15:47 | vote | accept | JumpJump | ||
| Sep 23, 2016 at 2:22 | answer | added | Nawaf Bou-Rabee | timeline score: 1 | |
| Sep 23, 2016 at 1:41 | comment | added | Steven Stadnicki | That's at the heart of those methods, though it's more about the techniques in general than their use in this particular problem. And without bounded variation, it's effectively impossible to refine the intervals down to make any actual progress on them. | |
| Sep 22, 2016 at 23:58 | comment | added | JumpJump | @StevenStadnicki Thank you sir. I googled the interval methods, does this link leads to the method you want to refer to? and why bounded variation is important? thank you! en.wikipedia.org/wiki/Interval_arithmetic | |
| Sep 22, 2016 at 23:55 | comment | added | Steven Stadnicki | If your function is of bounded variation (and if you can quantify that variation) then you can look into so-called interval methods which (as long as the bounds are good) often allow for relatively efficient and robust pruning. | |
| Sep 22, 2016 at 22:49 | history | edited | JumpJump | CC BY-SA 3.0 |
added 56 characters in body
|
| Sep 22, 2016 at 22:38 | answer | added | Eugene | timeline score: 6 | |
| Sep 22, 2016 at 22:32 | history | asked | JumpJump | CC BY-SA 3.0 |