Pages that link to "Item:Q620432"
From MaRDI portal
The following pages link to On a global complexity bound of the Levenberg-marquardt method (Q620432):
Displayed 7 items.
- The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem (Q410763) (← links)
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
- Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method (Q2374367) (← links)
- A modified Levenberg-Marquardt method with line search for nonlinear equations (Q2374368) (← links)
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
- Global complexity bound of the Levenberg–Marquardt method (Q2829563) (← links)