Revision as of 21:48, 16 August 2019 edit Aakkbbrr (talk \| contribs) 254 edits →See also: removed childishly written irrelevance ← Previous edit		Revision as of 14:11, 4 September 2019 edit undo Berean Hunter (talk \| contribs) Extended confirmed users 72,802 edits m rv LTA Tag: Rollback Next edit →
Line 71: == See also == * [[Trust region]] * [[Nelder–Mead method]] (aka simplex) * Variants of the Levenberg–Marquardt algorithm have also been used for solving nonlinear systems of equations.<ref>{{cite journal \|doi=10.1016/j.cam.2004.02.013\|title=Levenberg–Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints\|journal=Journal of Computational and Applied Mathematics\|volume=172\|issue=2\|pages=375–397\|year=2004\|last1=Kanzow\|first1=Christian\|last2=Yamashita\|first2=Nobuo\|last3=Fukushima\|first3=Masao}}</ref>

Levenberg–Marquardt algorithm: Difference between revisions