Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations
type: Item
instance of: scholarly article
title: Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations
zbMATH Open document ID: 1505.65222
author: Ruixue Zhao
author: Jinyan Fan
published in: Computational Optimization and Applications
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7596178
zbMATH Keywords: Levenberg-Marquardt method
zbMATH Keywords: probabilistic Jacobian models
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: global convergence
cites work: DFO
cites work: Convergence of Trust-Region Methods Based on Probabilistic Models
cites work: Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation
cites work: Derivative-Free Optimization of Expensive Functions with Computational Error Using Weighted Regression
cites work: Condition Numbers of Gaussian Random Matrices
cites work: Q4421356
cites work: Geometry of interpolation sets in derivative free optimization
cites work: Introduction to Derivative-Free Optimization
cites work: The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence
cites work: An adaptive multi-step Levenberg-Marquardt method
cites work: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
cites work: Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
cites work: A method for the solution of certain non-linear problems in least squares
cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters
cites work: Random optimization
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Efficiency of coordinate descent methods on huge-scale optimization problems
cites work: Q4083217
cites work: On trust region methods for unconstrained minimization without derivatives
cites work: On the Convergence of Pattern Search Algorithms
cites work: Worst case complexity of direct search
cites work: Q2765625
cites work: On a new updating rule of the Levenberg-Marquardt parameter
describes a project that uses: DFO
describes a project that uses: COBYLA2
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10589-022-00393-9
OpenAlex ID: W4288705883
DOI: 10.1007/S10589-022-00393-9
description: scientific article; zbMATH DE number 7596178