Timeline for Determining if a quadratic form is non-negative if variables are non-negative
Current License: CC BY-SA 4.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Sep 28, 2020 at 9:41 | history | bounty ended | mathworker21 | ||
S Sep 28, 2020 at 9:41 | history | notice removed | mathworker21 | ||
Sep 21, 2020 at 12:54 | answer | added | Bill Bradley | timeline score: 2 | |
Sep 21, 2020 at 12:18 | answer | added | Adam P. Goucher | timeline score: 2 | |
Sep 21, 2020 at 9:00 | history | edited | mathworker21 | CC BY-SA 4.0 |
added 27 characters in body
|
Sep 21, 2020 at 8:25 | comment | added | alezok | You might find the criteria that you're looking for in this article Hannu Väliaho - Criteria for copositive matrices (1986) | |
Sep 21, 2020 at 7:56 | comment | added | Harry West | You want to test whether a matrix is "copositive". | |
S Sep 21, 2020 at 7:38 | history | bounty started | mathworker21 | ||
S Sep 21, 2020 at 7:38 | history | notice added | mathworker21 | Draw attention | |
Sep 20, 2020 at 14:04 | history | edited | mathworker21 | CC BY-SA 4.0 |
added 295 characters in body
|
Sep 19, 2020 at 5:56 | comment | added | Steven Stadnicki | Isn't this just a form of Quadratic Programming? Since you have no constraints on your $c_{ij}$ I believe it'll be NP-hard, so you shouldn't expect a much quicker way. | |
Sep 19, 2020 at 4:36 | comment | added | mathworker21 | @vidyarthi if you diagonalize, it is very hard to use the non-negativity condition, which might be (and is, in my particular case) crucial. I think you might be thinking about showing the quadratic form is positive definite, which is stronger. | |
Sep 19, 2020 at 4:24 | comment | added | vidyarthi | will not diagonaliztion of symmetric matrices algorithm work here? | |
Sep 19, 2020 at 2:15 | history | edited | mathworker21 | CC BY-SA 4.0 |
added 22 characters in body
|
Sep 19, 2020 at 1:49 | history | asked | mathworker21 | CC BY-SA 4.0 |