Timeline for Is there a closed-form solution for $\max_D \operatorname{Tr}(ADBD)$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16 at 16:28 | answer | added | Joseph Van Name | timeline score: 0 | |
| Mar 15 at 6: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. | |
| Feb 14 at 12:51 | comment | added | Joseph Van Name | +1. Is there any reason why A,B need to be positive definite? | |
| Feb 14 at 5:35 | history | edited | Michael Hardy | CC BY-SA 4.0 |
added 8 characters in body; edited title
|
| Feb 14 at 2:18 | comment | added | Nathaniel Johnston | Neat question. Can I ask where it comes up? I’d be very (pleasantly) surprised if there existed a method of computation that is significantly better than the obvious brute-force method (e.g., a method that is polynomial in N for all m). | |
| Feb 14 at 1:37 | answer | added | Iosif Pinelis | timeline score: 1 | |
| Feb 14 at 0:51 | comment | added | CWC | I think this is equivalent to $\max_D \text{sum}(D (A\odot B) D) $ where $\text{sum}()$ adds up all elements in a given matrix. Perhaps this is the furthest we can get. | |
| Feb 14 at 0:39 | history | edited | CWC | CC BY-SA 4.0 |
added 14 characters in body
|
| Feb 14 at 0:33 | history | asked | CWC | CC BY-SA 4.0 |