The Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » Software » comp.soft-sys.matlab

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Toan Cao

Posts: 55
Registered: 10/15/10
Re: Non-linear optimization
Posted: Mar 4, 2013 10:36 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

"Steven_Lord" <> wrote in message <kh2ni9$9ar$>...
> "Toan Cao" <> wrote in message
> news:kh2m44$4eh$

> > Hi everyone,
> >
> > I have a question relating to non-linear optimization and hope to receive
> > your help!
> > If i have a cost function F(x) in general form. I mean it can not be
> > described in the form of F(x)= f(x)'.f(x) (where f(x)' is transposition of
> > f(x) ) as required by some methods such as Levenberg-Marquardt,
> > Gauss-Newton for finding a local minimum value.
> > If i want to use above two methods, what should i do ?
> > Do you know any method that i can use in this case?

> Do you have a MATLAB function that accepts a vector of parameters to be
> optimized and returns the value of your cost function? If so, you're okay.
> Most of the Optimization Toolbox and Global Optimization Toolbox solvers
> don't care what you do inside your objective function to obtain the values
> they seek (as long as your underlying function is smooth, for some of them)
> as long as you return the cost function values from your objective function.
> You could do calculations. You could retrieve information from disk. You
> could query an instrument or database. You could even prompt the user to
> INPUT the result of performing a physical experiment for a set of parameter
> values.
> --
> Steve Lord
> To contact Technical Support use the Contact Us link on

Thanks for your reply, Steve Lord.
Can i ask you more about this problem ?
As i know, Levenberg-Marquardt, Gauss-Newton methods use f(x) to calculate the Jacobian matrix. If i just have F(x) ( not f(x) ), how does optimization solvers compute this matrix? Can you explain for me the way that the solvers implement ?
Actually, i need to understand more deeply and hope to modify somethings for my specific function.
Thanks in advance.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.