New inexact line search method for unconstrained optimization

DOI10.1007/s10957-005-6553-6zbMath1116.90097OpenAlexW2141345207MaRDI QIDQ850832

Jie Shen, Zhen-Jun Shi

Publication date: 6 November 2006

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/45195

zbMATH Keywords

global convergenceinexact line searchconvergence rateUnconstrained optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items

A new robust line search technique based on Chebyshev polynomials ⋮ The convergence of subspace trust region methods ⋮ A new class of supermemory gradient methods ⋮ A nonmonotone ODE-based method for unconstrained optimization ⋮ A nonmonotone trust region method with new inexact line search for unconstrained optimization ⋮ A nonmonotone line search slackness technique for unconstrained optimization ⋮ New cautious BFGS algorithm based on modified Armijo-type line search ⋮ Nonmonotone adaptive trust region method ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ A new non-monotone self-adaptive trust region method for unconstrained optimization ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions ⋮ Convergence of nonmonotone line search method ⋮ Global convergence of conjugate gradient method ⋮ A new family of conjugate gradient methods ⋮ A new trust region method with adaptive radius ⋮ Optimization on the hierarchical Tucker manifold - applications to tensor completion ⋮ Convergence of descent method with new line search

Uses Software

• minpack

Cites Work

• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• Stepsize analysis for descent methods
• 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
• R-linear convergence of the Barzilai and Borwein gradient method
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• Testing Unconstrained Optimization Software
• On Convergence Properties of Algorithms for Unconstrained Minimization
• On the Barzilai and Borwein choice of steplength for the gradient method
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• On the nonmonotone line search

This page was built for publication: New inexact line search method for unconstrained optimization