Bound constrained Levenberg Marquard


hawkeye
11-04-2003, 02:55 AM
Hello!

For a project at the University of Twente (netherlands) i need to make a curvefititng routine for a function which has 2 parameters. The problem is that i do not want any complex numbers and because there is a logaritm in the function that's the case at this time.

Now i already made some time ago a Levenberg Marquard algorithm in C++ with the help of NR.

My question is if someone has experience with a bound contrained LM algorithm are any other suggestion maybe which algorithm would be better?

thanks a lot already

Hasse Wiersma