Levenberg–Marquardt algorithm: Difference between revisions

Content deleted Content added
Frau Holle (talk | contribs)
No edit summary
Frau Holle (talk | contribs)
Line 10:
:'''f'''<sup>T</sup>=(''f''<sub>1</sub>, ..., ''f''<sub>''m''</sub>), and '''p'''<sup>T</sup>=(''p''<sub>1</sub>, ..., ''p''<sub>''n''</sub>).
The least squares problem consists in finding the parameter vector '''p''' for which the cost function
:''S''('''p''') = '''f'''<sup>T</sup>'''f'''=<math>\sum_{i=1}^{m}</math> [''f''<sub>''i''</sub>('''p''')]<sup>2</sup>
becomes minimal.