Timeline for On solution methods for min-min optimization problems
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 31, 2019 at 9:02 | vote | accept | John D | ||
| Jul 30, 2019 at 10:04 | answer | added | Wenqing Ouyang | timeline score: 1 | |
| Jul 30, 2019 at 8:07 | comment | added | John D | @foxell thanks for the comment. However, note that in general, you can't find global minimums. The idea is to build a method that converges to a stationary point of the problem. | |
| Jul 30, 2019 at 3:04 | comment | added | Wenqing Ouyang | Notice that you could exchange the minimum in any case without changing the final value. So your problem is equivalent to $\min_{i=1,...,q}\min_{x\in\Omega}f_i(x)$, and you just need to optimize each function. | |
| Jul 27, 2019 at 14:54 | history | asked | John D | CC BY-SA 4.0 |