Convergence of descent method with new line search
type: Item
instance of: scholarly article
title: Convergence of descent method with new line search
zbMATH Open document ID: 1137.90674
DOI: 10.1007/BF02831936
author: Zhenjun Shi
author: Jie Shen
published in: Journal of Applied Mathematics and Computing
publication date: 2006-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 5007509
describes a project that uses: minpack
MaRDI profile type: Publication
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Weak sufficient convergence conditions and applications for Newton methods
cites work: Two-Point Step Size Gradient Methods
cites work: A truncated Newton method with non-monotone line search for unconstrained optimization
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: On Steepest Descent
cites work: Testing Unconstrained Optimization Software
cites work: Numerical Optimization
cites work: Optimization. Algorithms and consistent approximations
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: Global convergence of nonmonotone descent methods for unconstrained optimization problems
cites work: An adaptive approach of conic trust-region method for unconstrained optimization problems
cites work: Convergence of line search methods for unconstrained optimization
cites work: New inexact line search method for unconstrained optimization
cites work: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
cites work: On Convergence Properties of Algorithms for Unconstrained Minimization
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
cites work: Convergence Conditions for Ascent Methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
full work available at URL: https://doi.org/10.1007/bf02831936
OpenAlex ID: W1991034003
description: scientific article; zbMATH DE number 5007509