Timeline for Constraint optimization problem for any dimensionality $n>1$.
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2013 at 23:34 | answer | added | Suvrit | timeline score: 2 | |
| Apr 23, 2013 at 19:31 | comment | added | Mark | @Steve Huntsman: The DFT is applicable only to numerical matrices. The above one is not such matrix. | |
| Apr 23, 2013 at 19:15 | answer | added | Yoav Kallus | timeline score: 2 | |
| Apr 23, 2013 at 19:01 | comment | added | Steve Huntsman | @Mark: Your matrix is circulant. The DFT diagonalizes circulant matrices. | |
| Apr 23, 2013 at 18:36 | comment | added | Mark | @Yoav Kallus: Can you kindly explain your suggestion concerning the discrete Fourier transform? | |
| Apr 23, 2013 at 17:40 | comment | added | Mark | The Kuhn-Tucker conditions also include the complementary slackness conditions and the constraints. These are omitted by you. | |
| Apr 23, 2013 at 17:12 | comment | added | Yoav Kallus | In no particular order: take the discrete Fourier transform; read the faq; ask on math.stackexchange.com | |
| Apr 23, 2013 at 16:44 | answer | added | Mark | timeline score: 1 | |
| Apr 23, 2013 at 15:42 | history | asked | Francis | CC BY-SA 3.0 |