This is a simple problem. Normaly I use two for-loops in GNU Octave to find the parameter a and b and K.The cost function I'm going to minimize is: V = ∑ i = 0 N ( | u i − K − u 0 a − b t i | )Where u i is a vector for measurement and t i is also a measured vector. u 0 is known so only a, b, K is unknow.Is there any other way to minimize V instead of using three for-loops in GNU Octave?In my case, two-variables can solve the problem too. The K is just a correction factor. Not necessary to 100%.

Question

This is a simple problem. Normaly I use two for-loops in GNU Octave to find the parameter   a and   b and   K.The cost function I&#039;m going to minimize is:  V  =      ∑          i      =      0        N    (      |        u    i    −  K  −      u    0        a          −      b              t        i                  |    )Where       u    i   is a vector for measurement and       t    i   is also a measured vector.       u    0   is known so only   a,  b,  K is unknow.Is there any other way to minimize   V instead of using three for-loops in GNU Octave?In my case, two-variables can solve the problem too. The   K is just a correction factor. Not necessary to 100%.

postojahob · Accepted Answer

Have you looked at fminsearch? It can minimize a cost function over several parameters (just put them together in one vector).

This is a simple problem. Normaly I use two for-loops in GNU Octave to find the parameter a an

Answered question

Answer & Explanation

New Questions in Pre-Algebra