Reusing the Gram matrix for m iterations in a Levenberg-Marquardt method yields global convergence with O(d^3/epsilon + d^2/epsilon^2) total cost and local superlinear rate.
A Newton-Raphson method for the solution of systems of equations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An Enhanced Levenberg--Marquardt Method via Gram Reduction
Reusing the Gram matrix for m iterations in a Levenberg-Marquardt method yields global convergence with O(d^3/epsilon + d^2/epsilon^2) total cost and local superlinear rate.