Undergrad How can robust linear estimation be carried out in a non-linear context?

Click For Summary
To minimize a function dependent on three parameters, including one nonlinear, the approach should involve calculating the linear parameters iteratively within the nonlinear method rather than isolating the nonlinear parameter first. This reduces the three-dimensional minimization problem to a one-dimensional one, simplifying the process significantly. The linear parameters can be derived through linear minimization for each iteration of the nonlinear parameter. There is some uncertainty regarding whether the parameters involved are truly linear due to their presence within absolute values. Clarifying these aspects is essential for effective robust linear estimation in a non-linear context.
borson
Messages
29
Reaction score
0
Hi and thanks to everyone for his/her attention. I have to minimize a function that depends on several parameters. The aim of minimizing that function is to actually guess these parameters, which are unknown. The thing is that the author of the pdf from which I have to make the calculations, does not specify very well how to carry it out. There are 3 parameters the function depends on (one of them nonlinear), and the author says that first off we have to figure out the nonlinear parameter, by trisecting a determined interval, and afterwards guess the spare ones by means of another function that will also have to be minimized by robust linear estimation. So here is where my doubts come, how should robust linear estimation be carried out in that context? What do yk and xk stand for?.

Here is the part of the pdf in which that function is shown:

you can find the whole pdf here:http://www.roulettephysics.com/wp-content/uploads/2014/01/Roulette_Physik.pdf

that function is in the 13 page.

thank you all for your attention and I hope you can help me :)
 
Physics news on Phys.org
borson said:
There are 3 parameters the function depends on (one of them nonlinear), and the author says that first off we have to figure out the nonlinear parameter, by trisecting a determined interval, and afterwards guess the spare ones by means of another function that will also have to be minimized by robust linear estimation.

No, you don't have to figure out the nonlinear parameter first and guess the linear parameters afterwards. You need to calculate the linear parameters with a linear method for each iteration step within the non-linear method. This way you can reduce the three-dimensional minimization problem

S\left( {\eta ,\bar \Omega _f^2 ,\varphi } \right) \Rightarrow Min.

to the one-dimensional problem

S\left( \varphi \right) = S\left( {\eta \left( \varphi \right),\bar \Omega _f^2 \left( \varphi \right),\varphi } \right) \Rightarrow Min.

which is much easier to solve even if the funktions \eta \left( \varphi \right) and \bar \Omega _f^2 \left( \varphi \right) need to be calculated by linear minimization for every value ##\varphi##.

However, I'm not sure if the parameters ##\eta## and ##\bar \Omega _f^2## are really linear because they are within absolute values.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
5K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 8 ·
Replies
8
Views
6K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K