Timeline for least square optimization under positive semidefinite constraint [duplicate]
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 5, 2017 at 23:46 | history | closed |
R.P. András Bátkai Yoav Kallus Henry.L Kim Morrison |
Duplicate of Standard solution to semidefinite program [closed] | |
| Jun 5, 2017 at 14:04 | review | Close votes | |||
| Jun 5, 2017 at 23:46 | |||||
| Jun 5, 2017 at 1:10 | answer | added | Mark L. Stone | timeline score: 0 | |
| Aug 31, 2016 at 10:44 | comment | added | fedja | Yes in the sense that the problem is trivial ($aX$ is just either an arbitrary vector whose scalar product with $a$ is positive, or $0$) and No in the sense that the minimum is just not attained if $(a,b)\le 0$ and $b$ is not collinear to $a$.. | |
| Aug 31, 2016 at 8:09 | history | asked | Michael Fan Zhang | CC BY-SA 3.0 |