Two modified HS type conjugate gradient methods for unconstrained optimization problems

DOI10.1016/j.na.2010.09.046zbMath1203.49049OpenAlexW1992047442MaRDI QIDQ611200

Zhi-feng Dai

Publication date: 14 December 2010

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2010.09.046

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodline searchsufficient descent property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Related Items (18)

A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method ⋮ A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems ⋮ A new class of nonlinear conjugate gradient coefficients with global convergence properties ⋮ A smoothing projected HS method for solving stochastic tensor complementarity problem ⋮ A class of accelerated conjugate-gradient-like methods based on a modified secant equation ⋮ A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method ⋮ A nonlinear conjugate gradient method for a special class of matrix optimization problems ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches ⋮ A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method ⋮ Nonlinear conjugate gradient methods for continuous-time output feedback design ⋮ Association of Jensen's inequality for \(s\)-convex function with Csiszár divergence ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation ⋮ Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization ⋮ NEW COMPUTATIONS OF OSTROWSKI-TYPE INEQUALITY PERTAINING TO FRACTAL STYLE WITH APPLICATIONS ⋮ A new class of nonlinear conjugate gradient coefficients for unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• Efficient generalized conjugate gradient algorithms. I: Theory
• Global convergence result for conjugate gradient methods
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A three-parameter family of nonlinear conjugate gradient methods
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• A modified BFGS method and its global convergence in nonconvex minimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Two modified HS type conjugate gradient methods for unconstrained optimization problems