Convergence of quasi-Newton method with new inexact line search

DOI10.1016/j.jmaa.2005.05.077zbMath1093.65063OpenAlexW1999244595MaRDI QIDQ819030

Zhen-Jun Shi

Publication date: 22 March 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.05.077

zbMATH Keywords

unconstrained optimizationglobal convergencemathematical programmingquasi-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (8)

A self-adaptive trust region method with line search based on a simple subproblem model ⋮ The convergence of subspace trust region methods ⋮ A new class of supermemory gradient methods ⋮ Nonmonotone adaptive trust region method ⋮ Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation ⋮ The hybrid BFGS-CG method in solving unconstrained optimization problems ⋮ Convergence rate of descent method with new inexact line-search on Riemannian manifolds ⋮ Sufficient descent directions in unconstrained optimization

Cites Work

• Optimization. Algorithms and consistent approximations
• Some convergence properties of descent methods
• Convergence of line search methods for unconstrained optimization
• A new unconstrained optimization method for imprecise function and gradient values
• A class of gradient unconstrained minimization algorithms with adaptive stepsize
• Minimization of functions having Lipschitz continuous first partial derivatives
• On Convergence Properties of Algorithms for Unconstrained Minimization
• Numerical Optimization
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• On Steepest Descent

This page was built for publication: Convergence of quasi-Newton method with new inexact line search