Timeline for Maximize the determinant of Boolean combinations of positive definite matrices
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 28, 2017 at 14:55 | history | edited | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor improvements
|
| Apr 28, 2017 at 1:30 | comment | added | Pascal | Nice! Appreciate! | |
| Apr 27, 2017 at 13:37 | history | edited | Rodrigo de Azevedo | CC BY-SA 3.0 |
Improved the answer
|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 6, 2017 at 21:51 | vote | accept | Pascal | ||
| Apr 6, 2017 at 21:51 | |||||
| Apr 5, 2017 at 18:22 | comment | added | Pascal | Thank you. I have thought of this lower bound before, the reason why I did not go further on that because it is too simple: a greedy algorithm (pick the s largest c_i can solve it); After relaxing z_i to be continuous in [0,1]. As I mentioned previously, I have derived formula for first order derivative , i.e. gradient. Using algorithm like Conjugate gradient or BFGS type methods, etc., of which only exact analytic gradient formula is required but no need for exact analytic Hessian formula. | |
| Apr 5, 2017 at 9:37 | history | edited | Rodrigo de Azevedo | CC BY-SA 3.0 |
added 63 characters in body
|
| Apr 5, 2017 at 2:26 | history | edited | Rodrigo de Azevedo | CC BY-SA 3.0 |
added 38 characters in body
|
| Apr 5, 2017 at 2:20 | history | answered | Rodrigo de Azevedo | CC BY-SA 3.0 |