Timeline for Maximizing a convex function with a convex constraint
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2018 at 17:46 | answer | added | Liviu Nicolaescu | timeline score: 0 | |
| May 29, 2018 at 17:40 | vote | accept | user3492773 | ||
| May 29, 2018 at 17:39 | comment | added | user3492773 | Thanks for helping out. I wanted to mention that I knew the max is attained it attains on some external point, however how can it be find? The sublevel set can be any convex set, not just polyhedron | |
| May 29, 2018 at 17:38 | comment | added | user64494 | Your question is too general. Is it a question at the research level? Did you try googling? | |
| May 29, 2018 at 17:38 | answer | added | Mark L. Stone | timeline score: 5 | |
| May 29, 2018 at 17:33 | comment | added | Pietro Majer | A convex function on a compact convex set always attains its maximum on some extremal point. This may simplify the search --e.g. in the case of a polyhedron | |
| May 29, 2018 at 17:27 | review | Close votes | |||
| May 31, 2018 at 20:55 | |||||
| May 29, 2018 at 17:26 | comment | added | Hans | Is it easy to find the zeros of the Lagrangian $\|x\|^2_2-\lambda f(x)=0$ for some constant $\lambda$? | |
| May 29, 2018 at 17:02 | review | First posts | |||
| May 29, 2018 at 17:09 | |||||
| May 29, 2018 at 16:59 | history | asked | user3492773 | CC BY-SA 4.0 |