On Jul 16, 11:14 pm, Daniel Friedan dfrie...@gmail.com wrote:
an update:
minimize() is much improved using Harald Schilly's suggestion to
provide an explicit gradient function defined with fast_float().
succeeded:
minimizing a quartic polynomial in 100 variables containing
1,100,411
it's a research project I am working on ---
On Jul 14, 1:48 am, Alec Battles alec.batt...@gmail.com wrote:
Sounds like an interesting project. Is it for school or for fun?
I'm using Sage to make art and sorta failing. If I knew more
programming I'd give it a lot more time, but sadly my only
I use p = Polyhedron(vertices=set_of_vertices) to compute the convex
hull of the given set_of_vertices. It works fine except way too slow
when dealing with high dimension and large set of vertices. I am
wondering if there's anyway to speed up the process.
1) Is using Polyhedron() the
