Revision as of 08:51, 25 March 2006 edit 84.230.2.246 (talk) Added a link to Java LM implementations. ← Previous edit		Revision as of 16:34, 27 March 2006 edit undo 82.133.32.26 (talk) →The problem Next edit →
Line 7: == The problem == Given ~~are~~ ''m'' functions ''f''<sub>1</sub>, ..., ''f''<sub>''m''</sub> of ''n'' parameters ''p''<sub>1</sub>, ..., ''p''<sub>''n''</sub> with ''m''≥''n''. It is convenient to use vector notation for both the functions and the parameters, :'''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

Levenberg–Marquardt algorithm: Difference between revisions