On Jul 16, 11:14 pm, Daniel Friedan <[email protected]> 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 terms > (in 22329s of cpu time using 100% of one stock Intel core w > 64GB RAM) > failed : > on a quartic polynomial in 120 variables containing 2,217,743 terms. I am in no sense a SAGE epert, and don't even know what software SAGE is using for this. Clearly derivatives are helpful, BUT (even assuming you mean total degree =4), the derivatives will be substantially bigger than the original. Is it worth your while looking at cheap means for derivative evaluation: Morgenstern,J., How to Compute Fast a Function and all its Derivatives: a variation on the theorem of Baur-Strassen. SIGACT News 16(1985) 4 pp. 60-62.
-- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
