A randomized subspace Levenberg-Marquardt method with adaptively chosen subspace size retains O(epsilon^-2) complexity and shows practical cost savings.
Bjork, Numerical Methods for Least Squares Problems, Society for Industrial and Applied Mathematics, 1996
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
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A variable dimension sketching strategy for nonlinear least-squares
A randomized subspace Levenberg-Marquardt method with adaptively chosen subspace size retains O(epsilon^-2) complexity and shows practical cost savings.