Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods

DOI10.5556/J.TKJM.54.2023.4185MaRDI QIDQ6169313zbMATH OpenOpenAlexFDO

Authors Yuanming Xu, Mohammad Reza Bayat

Publication date 14 August 2023

Published in Tamkang Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5556/j.tkjm.54.2023.4185

zbMATH Keywords

conjugate gradient methodglobal convergencestrong Wolfe line searchunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Some three-term conjugate gradient methods for solving unconstrained optimization problems
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
• Some three-term conjugate gradient methods with the new direction structure
• Two new conjugate gradient methods for unconstrained optimization

Cites work

• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A new three-term conjugate gradient algorithm for unconstrained optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
• A survey of nonlinear conjugate gradient methods
• A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• An extended three-term conjugate gradient method with sufficient descent property
• 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
• Benchmarking optimization software with performance profiles.
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• CUTE
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3439906 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Impulse noise removal based on new hybrid conjugate gradient approach.
• Methods of conjugate gradients for solving linear systems
• New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
• Numerical Optimization
• Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
• Some three-term conjugate gradient methods for solving unconstrained optimization problems
• The conjugate gradient method in extremal problems

Cited in

(3)

• A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
• A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
• Some three-term conjugate gradient methods for solving unconstrained optimization problems

This page was built for publication: Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169313)