Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Topic: Non-linear optimization
Replies: 32   Last Post: Mar 8, 2013 2:22 AM

 Messages: [ Previous | Next ]
 Bruno Luong Posts: 9,254 Registered: 7/26/08
Re: Non-linear optimization
Posted: Mar 5, 2013 2:26 AM

"Matt J" wrote in message <kh32ds\$hrn\$1@newscl01ah.mathworks.com>...
> "Toan Cao" <toancv3010@gmail.com> wrote in message
>
> If you know a global lower bound on F(x), say F_low, then the minimization problem is equivalent to
>
> min f(x)'.f(x)
>
> where
>
> f(x)=F(x)- f_low
>
> So, you could apply Levenberg-Marquardt and/or Gauss-Newton to the reformulated problem.

I don't think it is a good suggestion. (1) It make the code difficult to handle since f_low needs to be known. It squares the conditioning of the original problem, and thus all kinds of numerical difficulties become more prominent.

When levenberg-Markquardt or pseudo-newton method is developed, f(x) is usually taken as the local Jacobian of F. And this approximation is generally known and studied. The approximation can be applied on any F (only assumed to be differentiable).

Bruno

Date Subject Author
3/4/13 Toan Cao
3/4/13 Steven Lord
3/4/13 Toan Cao
3/5/13 Steven Lord
3/5/13 Toan Cao
3/6/13 Matt J
3/6/13 Matt J
3/6/13 Toan Cao
3/6/13 Matt J
3/4/13 Matt J
3/4/13 Toan Cao
3/5/13 Matt J
3/5/13 Bruno Luong
3/6/13 Matt J
3/6/13 Bruno Luong
3/6/13 Matt J
3/6/13 Bruno Luong
3/6/13 Matt J
3/6/13 Bruno Luong
3/6/13 Matt J
3/7/13 Bruno Luong
3/7/13 Matt J
3/7/13 Bruno Luong
3/7/13 Matt J
3/7/13 Bruno Luong
3/7/13 Matt J
3/7/13 Bruno Luong
3/8/13 Matt J
3/8/13 Bruno Luong
3/7/13 Toan Cao
3/7/13 Matt J
3/7/13 Toan Cao
3/7/13 Matt J