Convergence analysis of a subsampled Levenberg-Marquardt algorithm
From MaRDI portal
Publication:6047687
DOI10.1016/j.orl.2023.05.005zbMath1525.65054OpenAlexW4378190561MaRDI QIDQ6047687
Xiantao Xiao, Jian Gu, Ganchen Xing
Publication date: 12 September 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2023.05.005
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53) Methods of successive quadratic programming type (90C55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing finite sums with the stochastic average gradient
- A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients
- Stochastic optimization using a trust-region method and random models
- Sub-sampled Newton methods
- Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
- Newton-type methods for non-convex optimization under inexact Hessian information
- First-order and stochastic optimization methods for machine learning
- Optimization theory and methods. Nonlinear programming
- Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition
- Hybrid Deterministic-Stochastic Methods for Data Fitting
- Convergence of Trust-Region Methods Based on Probabilistic Models
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Nonlinear least squares — the Levenberg algorithm revisited
- Optimization Methods for Large-Scale Machine Learning
- Extended Levenberg-Marquardt Method for Composite Function Minimization
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results
- Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg–Marquardt method
- An investigation of Newton-Sketch and subsampled Newton methods
- Globally Convergent Levenberg-Marquardt Method for Phase Retrieval
- A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
- A method for the solution of certain non-linear problems in least squares
- Exact and inexact subsampled Newton methods for optimization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
