Timeline for Parametric constrained optimization
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 23, 2018 at 4:25 | history | suggested | Rodrigo de Azevedo | CC BY-SA 4.0 |
Fixed LaTeX
|
| Aug 22, 2018 at 20:27 | review | Suggested edits | |||
| S Aug 23, 2018 at 4:25 | |||||
| Aug 22, 2018 at 19:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 23, 2018 at 18:13 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 23, 2018 at 16:16 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 26, 2018 at 2:11 | comment | added | fedja | I don't need the to know the exact minimum point, just whether the distance falls below d with the range. In other words you want to find out if a given $4$-th degree polynomial has real roots in a given interval. I would just implement Sturm criterion for the degree that low. You should be a bit careful with how you do it but at least you do not need to rely on the minimizers to catch the true global minimum instead of a local one or to search for all roots. Just my 2 cents :-) | |
| May 24, 2018 at 15:21 | answer | added | Mark L. Stone | timeline score: 2 | |
| May 24, 2018 at 14:08 | history | asked | Alan Swindells | CC BY-SA 4.0 |