Multi-step nonlinear conjugate gradient methods for unconstrained minimization

DOI10.1007/s10589-007-9087-zzbMath1181.90221OpenAlexW2022345660MaRDI QIDQ953210

Hiroshi Yabe, John A. Ford, Yasushi Narushima

Publication date: 17 November 2008

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

Full work available at URL: https://doi.org/10.1007/s10589-007-9087-z

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodline searchmulti-step secant condition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Related Items

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update, A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family, A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations, A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence, On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications, A new conjugate gradient algorithm for training neural networks based on a modified secant equation, Two-step conjugate gradient method for unconstrained optimization, Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition, Descent Perry conjugate gradient methods for systems of monotone nonlinear equations, Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization, Globally convergent modified Perry's conjugate gradient method, Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization, A smoothing conjugate gradient method for solving systems of nonsmooth equations, An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition, A limited memory descent Perry conjugate gradient method, Conjugate gradient methods using value of objective function for unconstrained optimization, Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems, Two new conjugate gradient methods based on modified secant equations, A descent family of Dai–Liao conjugate gradient methods, The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices, Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations, A new accelerated conjugate gradient method for large-scale unconstrained optimization, Scaled nonlinear conjugate gradient methods for nonlinear least squares problems, An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix, A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter, Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations, A modified Perry conjugate gradient method and its global convergence

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A truncated Newton method with non-monotone line search for unconstrained optimization
• New quasi-Newton equation and related methods for unconstrained optimization
• Multi-step quasi-Newton methods for optimization
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Technical Note—A Modified Conjugate Gradient Algorithm
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Conjugate Gradient Methods with Inexact Searches
• Numerical Optimization
• Line search algorithms with guaranteed sufficient decrease
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations