Timeline for Aleksandrov maximum principle for semi-convex function
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2020 at 20:46 | history | edited | Connor Mooney | CC BY-SA 4.0 |
added 29 characters in body
|
| Mar 17, 2020 at 18:47 | history | edited | Connor Mooney | CC BY-SA 4.0 |
added 343 characters in body
|
| Mar 17, 2020 at 18:13 | history | edited | Connor Mooney | CC BY-SA 4.0 |
deleted 3 characters in body
|
| Mar 17, 2020 at 16:15 | comment | added | Giovanni Febbraro | Thank you @ConnorMooney , there are a lot of thing that I never used (as the concave envelope, area formula). My book suggests to deduce it, from its validity for classical subsolution, by mollification since the Hessian matrices of the mollification of a semiconcave function will be bounded from below. Can you tell me something about these facts? | |
| Mar 17, 2020 at 16:05 | history | answered | Connor Mooney | CC BY-SA 4.0 |