Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


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

Topic: Segmented Optimization
Replies: 4   Last Post: Jul 30, 2012 3:35 PM

Advanced Search

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

Posts: 33
Registered: 10/4/11
Re: Segmented Optimization
Posted: Jul 30, 2012 9:48 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

> (1) seems the best approach to me. A one-dimensional problem should converge very fast. I don't really understand the motivation you've given for (2). Why would the constraint-solving fail if, as you say, "For a given theta, the constraints uniquely determine the rest of the parameters"? And if it can fail, why would (2) be any more robust to it?

The only way to solve for the parameters (given theta) is with a numerical algorithm. So (1) has the undesirable quality of using a numerical solver to solve a problem involving a numerical solver (i.e. 2 levels of numerical solving).

This means that the lower level of the numerical solving has to always succeed. If it succeeds 99% of the time but the code wants to check 100 values of theta, I could be stuck.

(1) also seemed the best to me despite this, but I wanted a second opinion.



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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.