Global complexity bound of the Levenberg-Marquardt method
From MaRDI portal
(Redirected from Publication:2829563)
Recommendations
- On a global complexity bound of the Levenberg-marquardt method
- Global complexity bound of the inexact Levenberg-Marquardt method
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- On the convergence rate of the inexact Levenberg-Marquardt method
- On a new updating rule of the Levenberg-Marquardt parameter
Cites work
- A note on the Levenberg-Marquardt parameter
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An inexact Levenberg-Marquardt method for large sparse nonlinear least squres
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Nonlinear least squares — the Levenberg algorithm revisited
- On a global complexity bound of the Levenberg-marquardt method
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
Cited in
(21)- A stochastic Levenberg-Marquardt method using random models with complexity results
- Complexity bound of a Levenberg-Marquardt algorithm based on probabilistic Jacobian models
- A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients
- On a global complexity bound of the Levenberg-marquardt method
- On the complexity of a stochastic Levenberg-Marquardt method
- A modified Levenberg-Marquardt algorithm for low order-value optimization problem
- A new nonmonotone modified Levenberg-Marquardt algorithm
- On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing
- Global complexity bound of the inexact Levenberg-Marquardt method
- A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations
- On a new updating rule of the Levenberg-Marquardt parameter
- Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
- A brief survey of methods for solving nonlinear least-squares problems
- Stochastic regularized Newton methods for nonlinear equations
- Some Algorithms of Nonlinear Least Squares Problems on Riemannian Manifolds
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares
- Newton-MR: inexact Newton method with minimum residual sub-problem solver
- Accelerated-gradient-based generalized Levenberg-Marquardt method with oracle complexity bound and local quadratic convergence
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
This page was built for publication: Global complexity bound of the Levenberg-Marquardt method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829563)
