Timeline for Minimum circumscribed ellipsoid of $\mathcal H$-polytope
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2021 at 15:57 | comment | added | Daniel Turizo | I've searched for more than 20 papers and never found that one, thank you so much. | |
| Aug 12, 2021 at 6:46 | comment | added | Rodrigo de Azevedo | @DanielTurizo I do not know and have no time to find out. However, after a couple of seconds of searching for papers, I found Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities, which must have some useful references. | |
| Aug 12, 2021 at 1:30 | comment | added | Daniel Turizo | @RodrigodeAzevedo thanks! do you think his book mentions that? so I can reference it. | |
| Aug 11, 2021 at 6:01 | comment | added | Rodrigo de Azevedo | According to Stephen Boyd, the optimization problem is NP-hard. | |
| Aug 11, 2021 at 5:58 | history | edited | Rodrigo de Azevedo | CC BY-SA 4.0 |
added 16 characters in body; edited tags
|
| S Aug 11, 2021 at 1:38 | history | suggested | J. W. Tanner | CC BY-SA 4.0 |
corrected spelling in title
|
| Aug 11, 2021 at 0:41 | review | Suggested edits | |||
| S Aug 11, 2021 at 1:38 | |||||
| Aug 10, 2021 at 2:39 | comment | added | Daniel Turizo | Do you have any relevant reference? I already looked in Kachiyan's algorithm but once you get an ellipsoid with center in the interior of $P$ the iteration cannot proceed anymore. | |
| Aug 10, 2021 at 1:31 | comment | added | Turbo | I think the problem is $\#P$ complete and computing volume information of any kind is hard. Having said that I would recommend looking at Khachiyan's algorithm for helpful information. | |
| Aug 10, 2021 at 0:02 | history | asked | Daniel Turizo | CC BY-SA 4.0 |