Global complexity bound of the Levenberg–Marquardt method (Q2829563): Difference between revisions

@@ Property / cites work @@
+Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
+Normal rank
@@ Property / cites work @@
+A note on the Levenberg-Marquardt parameter
@@ Property / cites work: A note on the Levenberg-Marquardt parameter / rank @@
+Normal rank
@@ Property / cites work @@
+On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
+Normal rank
@@ Property / cites work @@
+On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
+Normal rank
@@ Property / cites work @@
+Modified Gauss–Newton scheme with worst case guarantees for global performance
+Normal rank
@@ Property / cites work @@
+Nonlinear least squares — the Levenberg algorithm revisited
+Normal rank
@@ Property / cites work @@
+Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
+Normal rank
@@ Property / cites work @@
+On a global complexity bound of the Levenberg-marquardt method
+Normal rank
@@ Property / cites work @@
+Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
+Normal rank
@@ Property / cites work @@
+An inexact Levenberg-Marquardt method for large sparse nonlinear least squres
+Normal rank