Timeline for How to examine the convexity of a complex function numerically?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2013 at 15:57 | vote | accept | behrad mahboobi | ||
| May 23, 2016 at 3:19 | |||||
| Oct 3, 2013 at 6:12 | answer | added | Robert Israel | timeline score: 4 | |
| Oct 2, 2013 at 23:08 | comment | added | SashaKolpakov | @behradmahboobi: a convex function defined over an open domain, I believe, is always continuous and a.e. differentiable. Thus, the mentioned properties will not contribute anything new to the problem. | |
| Oct 2, 2013 at 23:01 | history | edited | behrad mahboobi | CC BY-SA 3.0 |
added 97 characters in body
|
| Oct 2, 2013 at 22:09 | comment | added | behrad mahboobi | actually i know my function is continuous and almost everywhere differentiable ! does that help to reduce the complexity load? | |
| Oct 2, 2013 at 22:04 | comment | added | Piyush Grover | Deciding complexity for polynomial functions is known to be NP-hard problem (in number of terms of the polynomial), so for all practical purposes your complicated function is probably so too. If all you have is a black box function, you might want to try branch and bound type of methods. | |
| Oct 2, 2013 at 21:44 | comment | added | behrad mahboobi | this paper is a very narrow example sorry. | |
| Oct 2, 2013 at 21:37 | comment | added | Carlo Beenakker | ima.umn.edu/preprints/APRIL1993/1133.pdf | |
| Oct 2, 2013 at 21:30 | history | asked | behrad mahboobi | CC BY-SA 3.0 |