Timeline for Is convex optimisation in P?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 30, 2019 at 16:35 | comment | added | user17918 | @SergeyDovgal As far as I know, one can only claim the linear programming is solvable in polynomial time. For other convex optimization problems, if they depend on the square-root-sum, one can not claim they are truly polynomial-time solvable. | |
| Jul 30, 2019 at 16:30 | history | edited | user17918 | CC BY-SA 4.0 |
added 365 characters in body
|
| Jul 29, 2019 at 9:57 | comment | added | Sergey Dovgal | I think that my question needs to be reformulated. SDP is clearly a convex optimisation problem (optimising a convex function over a convex set), but my question specifically points to the standard form of convex optimisation, where the convex set is defined by the set of inequalities "convex function is negative". Do you believe that the answer to that particular form (convex optimisation in standard form is in P) is unknown? | |
| Jul 27, 2019 at 23:12 | history | edited | user17918 | CC BY-SA 4.0 |
deleted 229 characters in body
|
| Jul 27, 2019 at 7:33 | history | answered | user17918 | CC BY-SA 4.0 |