Timeline for Converting a vector in a cone statement to inequality constraints
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 16, 2019 at 21:37 | comment | added | Jacob Di | I see now. You are right. | |
| Aug 16, 2019 at 20:41 | comment | added | Federico Poloni | No, you can't. What that formula computes is the projection of $x$ over the range of $N$. For instance, if $N=[1, 0]^T$, then $x=[1,1]^T$ satisfies the inequality in your comment, but not the one in your question. | |
| Aug 16, 2019 at 20:31 | comment | added | Jacob Di | In my case, $N$ is full column rank. Can I do $N^\top x = N^\top N \lambda$, solve for $\lambda = (N^\top N)^{-1}N^\top x \geq 0$ ? | |
| S Aug 16, 2019 at 20:28 | history | suggested | Ali Taghavi |
I add a tag.
|
|
| Aug 16, 2019 at 20:16 | review | Suggested edits | |||
| S Aug 16, 2019 at 20:28 | |||||
| Aug 16, 2019 at 20:00 | review | First posts | |||
| Aug 16, 2019 at 21:32 | |||||
| Aug 16, 2019 at 19:57 | history | asked | Jacob Di | CC BY-SA 4.0 |