Timeline for Find a line such that sum of perpendicular distances of points to the line is minimized
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2015 at 2:29 | history | edited | user49129 | CC BY-SA 3.0 |
added 21 characters in body
|
| May 6, 2015 at 2:28 | comment | added | user49129 | @BenoîtKloeckner :) You're right. I will modify the problem. | |
| May 5, 2015 at 18:54 | comment | added | Benoît Kloeckner | I can answer the second question: yes, $\lVert s_1-s_2\rVert$ is bounded. By $2$, since $s_1$ and $s_2$ are unit vectors. | |
| Apr 15, 2015 at 15:24 | comment | added | user49129 | @user35593 I meant that it may converge to a local minimum rather than $s_2$ since the problem is not convex. | |
| Apr 9, 2015 at 9:41 | comment | added | user35593 | I think it does in your situation. The problem mentioned in the Wikipedia-article is just if you use it for sparse-recovery. Then you need to make sure that there exist a sparse solution. | |
| Apr 5, 2015 at 16:12 | comment | added | user49129 | @user35593 It seems that the iterative method doesn't necessarily converge to the optimum value. | |
| Apr 5, 2015 at 10:30 | comment | added | user35593 | You can use iteratively reweighted least squares to find $s_2$: en.wikipedia.org/wiki/Iteratively_reweighted_least_squares | |
| Apr 5, 2015 at 10:22 | answer | added | loup blanc | timeline score: 1 | |
| Apr 5, 2015 at 2:52 | history | edited | user49129 |
edited tags
|
|
| Apr 4, 2015 at 9:44 | history | asked | user49129 | CC BY-SA 3.0 |