Convergence of quasi-Newton method with new inexact line search
type: Item
instance of: scholarly article
title: Convergence of quasi-Newton method with new inexact line search
zbMATH Open document ID: 1093.65063
author: Zhenjun Shi
published in: Journal of Mathematical Analysis and Applications
publication date: 2006-03-22T00:00:00Z
review text: The author proposes a new inexact line search rule for a quasi-Newton method and establishes some global convergence results of this method. These results are useful in designing new quasi-Newton methods. Also, there is analysed the convergence rate of the quasi-Newton method with the new line search rule, is analyzed.
reviewed by: Stefan Mititelu
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 5014229
zbMATH Keywords: mathematical programming
zbMATH Keywords: quasi-Newton method
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: j.jmaa.2005.05.077
OpenAlex ID: W1999244595
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: On Steepest Descent
cites work: Numerical Optimization
cites work: Optimization. Algorithms and consistent approximations
cites work: Convergence of line search methods for unconstrained optimization
cites work: On Convergence Properties of Algorithms for Unconstrained Minimization
cites work: Some convergence properties of descent methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: Convergence Conditions for Ascent Methods
cites work: A class of gradient unconstrained minimization algorithms with adaptive stepsize
cites work: A new unconstrained optimization method for imprecise function and gradient values
DOI: 10.1016/J.JMAA.2005.05.077
description: scientific article; zbMATH DE number 5014229