Pages that link to "Item:Q2829563"

The following pages link to Global complexity bound of the Levenberg–Marquardt method (Q2829563):

Displaying 13 items.

• A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients (Q1616028) (← links)
• Global complexity bound of the inexact Levenberg-Marquardt method (Q1656193) (← links)
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
• On a new updating rule of the Levenberg-Marquardt parameter (Q1742685) (← links)
• Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations (Q2052297) (← links)
• Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems (Q2188951) (← links)
• A brief survey of methods for solving nonlinear least-squares problems (Q2273095) (← links)
• Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
• A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
• Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)
• On the complexity of a stochastic Levenberg-Marquardt method (Q6149301) (← links)
• Stochastic regularized Newton methods for nonlinear equations (Q6158978) (← links)
• A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations (Q6179880) (← links)