Finding the global maximum of a looong polynomial

[Gregor]

{ Please confine responses to C++ related such as e.g. cross platform libraries
-mod }

This polynomial has a couple hundred terms (but less than 30
variables), I haven't tested it, but I think mathematica could find
it's maximum, but I don't have access to mathematica. (
http://www.scientific-solutions.ch/tech/mathematica/products/mma/newin5/symbolic/maxmin.html
)

Is there a free library that has code that will do this? I have
searched online, and didn't find anything.
If no one knows of any free code, does anyone know of a discussion of
a suitable algorithm? I searched for that too, but could only find
really cutting edge stuff that I'm afraid I really don't understand.
( www.sics.se/ps/acclaim/deliverables/third_year/d2+9-3A5.ps.Z free
postscript reader: http://view.samurajdata.se/
)

I have tried to figure out a suitable method by using graph sketching
techniques from calculus, too, but I'm stumped.

--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]

[Jiang]

> Is there a free library that has code that will do this? I have
> searched online, and didn't find anything.
> If no one knows of any free code, does anyone know of a discussion of
> a suitable algorithm?

Did you read the FAQ for nonlinear programming?
@ http://www-unix.mcs.anl.gov/otc/Guide/faq/nonlinear-programming-faq.html

Since post in this group shall have C++ content, for an C++
implementation of
GA(Genetic Algorithm), please check GALib
@ http://lancet.mit.edu/ga/

HTH

JIang