On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing
DOI10.1007/S10915-024-02649-4zbMATH Open1547.65069MaRDI QIDQ6608067FDOQ6608067
Authors: Jinyan Fan 
Publication date: 19 September 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Recommendations
Levenberg-Marquardt methodderivative-free optimizationsmoothing techniqueglobal complexityprobabilistic gradient models
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Testing Unconstrained Optimization Software
- Random gradient-free minimization of convex functions
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Tensor Methods for Nonlinear Equations
- The NEWUOA software for unconstrained optimization without derivatives
- More test examples for nonlinear programming codes
- Benchmarking Derivative-Free Optimization Algorithms
- Convergence of trust-region methods based on probabilistic models
- A derivative-free algorithm for least-squares minimization
- Title not available (Why is that?)
- Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation
- Title not available (Why is that?)
- On trust region methods for unconstrained minimization without derivatives
- On a global complexity bound of the Levenberg-marquardt method
- Global complexity bound of the Levenberg-Marquardt method
- Title not available (Why is that?)
- Levenberg-Marquardt methods based on probabilistic gradient models and inexact subproblem solution, with application to data assimilation
- A derivative-free Gauss-Newton method
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
- Zeroth-order optimization with orthogonal random directions
- Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations
- Complexity and global rates of trust-region methods based on probabilistic models
- Stochastic Zeroth Order Gradient and Hessian Estimators: Variance Reduction and Refined Bias Bounds
Cited In (1)
This page was built for publication: On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608067)
