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 15 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)
- Global complexity bound of the inexact Levenberg-Marquardt method (Q1656193) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← 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)
- 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)
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← 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)
- Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods (Q5038173) (← links)
- Stochastic regularized Newton methods for nonlinear equations (Q6158978) (← links)