Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
type: Item
instance of: scholarly article
title: Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
zbMATH Open document ID: 1425.90112
author: Ji-Feng Bao
author: Carisa Kwok Wai Yu
author: Jen-Chih Yao
author: J. H. Wang
author: Yaohua Hu
published in: Computational Optimization and Applications
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7135244
zbMATH Keywords: nonlinear least squares problems
zbMATH Keywords: inexact Levenberg-Marquardt method
zbMATH Keywords: Lipschitz condition
zbMATH Keywords: local error bound
describes a project that uses: UTV
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10589-019-00111-y
OpenAlex ID: W2946967476
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Approximate Gauss-Newton methods for solving underdetermined nonlinear least squares problems
cites work: A Levenberg-Marquardt method with approximate projections
cites work: A Newton-Raphson method for the solution of systems of equations
cites work: Q4209222
cites work: Q4868585
cites work: Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
cites work: Weak Sharp Minima in Mathematical Programming
cites work: A Gauss-Newton method for convex composite optimization
cites work: Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
cites work: Inexact Newton Methods
cites work: Q3702408
cites work: Affine Invariant Convergence Theorems for Newton’s Method and Extensions to Related Methods
cites work: Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition
cites work: Inexact Levenberg-Marquardt method for nonlinear equations
cites work: On the convergence rate of the inexact Levenberg-Marquardt method
cites work: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
cites work: A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization
cites work: On the inexactness level of robust Levenberg–Marquardt methods
cites work: Solving mathematical programs with equilibrium constraints
cites work: Rank-Deficient and Discrete Ill-Posed Problems
cites work: A Kantorovich-type convergence analysis for the Gauss-Newton-method
cites work: Matrix Analysis
cites work: Group sparse optimization via $\ell_{p,q}$ regularization
cites work: On convergence rates of linearized proximal algorithms for convex composite optimization with applications
cites work: Inexact subgradient methods for quasi-convex optimization problems
cites work: Convergence of the steepest descent method for minimizing quasiconvex functions
cites work: A method for the solution of certain non-linear problems in least squares
cites work: On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
cites work: Global error bounds for piecewise convex polynomials
cites work: Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
cites work: On convergence of the Gauss-Newton method for convex composite optimization.
cites work: Extension of Hoffman’s Error Bound to Polynomial Systems
cites work: Error bounds for analytic systems and their applications
cites work: A Gauss–Newton method for solving bound-constrained underdetermined nonlinear systems
cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters
cites work: Q4148902
cites work: Testing Unconstrained Optimization Software
cites work: Error bounds for convex differentiable inequality systems in Banach spaces
cites work: Numerical Optimization
cites work: Error bounds in mathematical programming
cites work: On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
cites work: Q3998482
cites work: Weak Sharp Minima: Characterizations and Sufficient Conditions
cites work: Optimization theory and methods. Nonlinear programming
cites work: Linear convergence of CQ algorithms and applications in gene regulatory network inference
cites work: Q2765625
cites work: Error Bounds for Convex Polynomials
cites work: Historical Development of the Newton–Raphson Method
cites work: Improved convergence results for a modified Levenberg–Marquardt method for nonlinear equations and applications in MPCC
Wikidata QID: Q127803621
DOI: 10.1007/S10589-019-00111-Y
description: scientific article; zbMATH DE number 7135244