Timeline for Computing the closest point inside an intersection of half-spaces
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2019 at 23:23 | vote | accept | Danny Yaroslavski | ||
| Jun 4, 2019 at 18:14 | comment | added | Marcus Ritt | @DannyYaroslavski Possibly, but you will have to reinvent a good part of the techniques that are behind that convex program. As you observe you may have to consider all $m$ halfspaces, all $\binom{m}{2}$ edges, and all $\binom{m}{3}$ extreme points, and an optimal solution can occur in the interior of these sets. | |
| Jun 4, 2019 at 18:05 | comment | added | Danny Yaroslavski | Are there no properties that we can use here to solve without minimizing/having to model it as a convex program? | |
| Jun 4, 2019 at 17:50 | history | answered | Marcus Ritt | CC BY-SA 4.0 |