]> gitweb.michael.orlitzky.com - sage.d.git/commit
mjo/cone/decomposition.py: new pointed-linspace decomposition
authorMichael Orlitzky <michael@orlitzky.com>
Sun, 1 Feb 2026 18:55:15 +0000 (13:55 -0500)
committerMichael Orlitzky <michael@orlitzky.com>
Sun, 1 Feb 2026 18:55:15 +0000 (13:55 -0500)
commitf787663cc23d45b0cfd9f48dc2b05e4a289dead3
treedd98e8bf963c0b41dae98dc667843e1ae995e880
parentc7533f22bd759fd07f6af842b9e2bcf665f7d6dd
mjo/cone/decomposition.py: new pointed-linspace decomposition

Begin a new experiment with the pointed-linspace decomposition. We
know how to do this with orthogonal projections, but in Sage we must
work over the rationals (and arithmetic is much faster there anyway).
I sketched a quick proof of concept showing that this can be done, and
it's very likely that PPL does exactly the same thing when it
minimizes the generators in Cone().

But just in case, here's an implementation that definitely does what I
think it does.
mjo/cone/decomposition.py