Timeline for Is group theory useful in any way to optimization?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 9, 2014 at 16:25 | comment | added | Cristóbal Guzmán | This fact can (and has been) used in optimization to reduce dimensionality. In some cases, you can convert an SDP into an LP, which is a huge gain for computational solvers. However, convexity is crucial for rigorously reducing the problem to the quotient space. Here are some notes on how this tool can be applied to SDPs with some underlying symmetry arxiv.org/abs/0809.2017 | |
| Jun 18, 2014 at 23:20 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| May 16, 2014 at 16:38 | comment | added | rnegrinho | I would guess this would be something interesting to consider in continuous nonconvex optimization, when the cost function has some set of set of symmetries (e.g. invariant of to some or all permutations of the variables). I've never seen this done though. Probably because, as you say, the quotient space is in general not a nice space to work with. | |
| May 15, 2014 at 9:09 | history | answered | Thomas Richard | CC BY-SA 3.0 |